/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:14:14,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:14:14,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:14:14,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:14:14,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:14:14,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:14:14,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:14:14,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:14:14,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:14:14,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:14:14,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:14:14,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:14:14,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:14:14,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:14:14,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:14:14,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:14:14,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:14:14,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:14:14,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:14:14,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:14:14,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:14:14,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:14:14,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:14:14,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:14:14,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:14:14,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:14:14,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:14:14,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:14:14,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:14:14,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:14:14,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:14:14,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:14:14,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:14:14,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:14:14,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:14:14,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:14:14,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:14:14,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:14:14,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:14:14,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:14:14,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:14:14,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:14:14,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:14:14,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:14:14,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:14:14,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:14:14,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:14:14,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:14:14,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:14:14,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:14:14,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:14:14,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:14:14,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:14:14,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:14:14,316 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:14:14,317 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:14:14,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:14:14,317 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:14:14,317 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 13:14:14,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:14:14,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:14:14,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:14:14,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:14:14,546 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:14:14,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-04-28 13:14:14,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110cffda7/3afbc706f431402e885b07383cecbbfa/FLAG320872e4f [2022-04-28 13:14:14,941 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:14:14,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-04-28 13:14:14,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110cffda7/3afbc706f431402e885b07383cecbbfa/FLAG320872e4f [2022-04-28 13:14:15,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110cffda7/3afbc706f431402e885b07383cecbbfa [2022-04-28 13:14:15,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:14:15,347 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:14:15,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:14:15,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:14:15,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:14:15,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e7830a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15, skipping insertion in model container [2022-04-28 13:14:15,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:14:15,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:14:15,535 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_unwindbound100.c[526,539] [2022-04-28 13:14:15,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:14:15,555 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:14:15,563 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_unwindbound100.c[526,539] [2022-04-28 13:14:15,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:14:15,578 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:14:15,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15 WrapperNode [2022-04-28 13:14:15,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:14:15,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:14:15,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:14:15,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:14:15,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:14:15,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:14:15,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:14:15,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:14:15,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (1/1) ... [2022-04-28 13:14:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:14:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:15,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 13:14:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 13:14:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:14:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:14:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:14:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:14:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:14:15,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:14:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:14:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:14:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:14:15,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:14:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:14:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:14:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:14:15,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:14:15,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:14:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:14:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:14:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:14:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:14:15,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:14:15,782 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:14:15,783 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:14:15,946 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:14:15,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:14:15,951 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 13:14:15,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:14:15 BoogieIcfgContainer [2022-04-28 13:14:15,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:14:15,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:14:15,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:14:15,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:14:15,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:14:15" (1/3) ... [2022-04-28 13:14:15,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444b580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:14:15, skipping insertion in model container [2022-04-28 13:14:15,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:14:15" (2/3) ... [2022-04-28 13:14:15,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444b580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:14:15, skipping insertion in model container [2022-04-28 13:14:15,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:14:15" (3/3) ... [2022-04-28 13:14:15,961 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound100.c [2022-04-28 13:14:15,971 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:14:15,971 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:14:16,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:14:16,004 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73b582b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c5640fa [2022-04-28 13:14:16,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:14:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:14:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 13:14:16,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:16,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:16,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-28 13:14:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:16,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211373960] [2022-04-28 13:14:16,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-28 13:14:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:16,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115443489] [2022-04-28 13:14:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:14:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:16,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 13:14:16,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 13:14:16,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 13:14:16,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:14:16,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 13:14:16,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 13:14:16,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 13:14:16,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-28 13:14:16,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-28 13:14:16,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 13:14:16,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-28 13:14:16,222 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-28 13:14:16,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 13:14:16,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 13:14:16,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 13:14:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:14:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115443489] [2022-04-28 13:14:16,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115443489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:16,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:16,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:14:16,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:16,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211373960] [2022-04-28 13:14:16,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211373960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:16,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:16,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:14:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503299408] [2022-04-28 13:14:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:16,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:14:16,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:16,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:14:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:16,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:14:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:14:16,303 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:16,495 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-28 13:14:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:14:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:14:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 13:14:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 13:14:16,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 13:14:16,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:16,589 INFO L225 Difference]: With dead ends: 57 [2022-04-28 13:14:16,589 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 13:14:16,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:14:16,594 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:16,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 13:14:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 13:14:16,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:16,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:16,619 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:16,620 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:16,623 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 13:14:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 13:14:16,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:16,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:16,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 13:14:16,628 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 13:14:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:16,631 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 13:14:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 13:14:16,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:16,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:16,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:16,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-28 13:14:16,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-28 13:14:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:16,638 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-28 13:14:16,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-28 13:14:16,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-28 13:14:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 13:14:16,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:16,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:16,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:14:16,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-28 13:14:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546071977] [2022-04-28 13:14:16,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-28 13:14:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551717919] [2022-04-28 13:14:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:14:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:16,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 13:14:16,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 13:14:16,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 13:14:16,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:14:16,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 13:14:16,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 13:14:16,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 13:14:16,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-28 13:14:16,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:14:16,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:14:16,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 100);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:14:16,768 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:14:16,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:14:16,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-28 13:14:16,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 13:14:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:14:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:16,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551717919] [2022-04-28 13:14:16,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551717919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:16,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:16,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:16,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:16,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546071977] [2022-04-28 13:14:16,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546071977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:16,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:16,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815311206] [2022-04-28 13:14:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:16,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:14:16,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:16,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:16,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:16,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:14:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:16,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:14:16,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:14:16,787 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,082 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 13:14:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:14:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:14:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:14:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:14:17,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 13:14:17,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,134 INFO L225 Difference]: With dead ends: 41 [2022-04-28 13:14:17,134 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 13:14:17,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:17,135 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:17,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:14:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 13:14:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-28 13:14:17,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:17,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,142 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,143 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,145 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 13:14:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 13:14:17,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 13:14:17,147 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 13:14:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,149 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 13:14:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 13:14:17,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:17,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-28 13:14:17,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-28 13:14:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:17,152 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-28 13:14:17,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-28 13:14:17,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 13:14:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 13:14:17,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:17,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:17,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 13:14:17,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-28 13:14:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210674131] [2022-04-28 13:14:17,243 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-28 13:14:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:17,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534695261] [2022-04-28 13:14:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:14:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:17,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:14:17,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:17,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-28 13:14:17,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {502#false} is VALID [2022-04-28 13:14:17,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-28 13:14:17,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 100);havoc #t~post6; {502#false} is VALID [2022-04-28 13:14:17,333 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-28 13:14:17,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-28 13:14:17,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-28 13:14:17,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 13:14:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:14:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534695261] [2022-04-28 13:14:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534695261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:17,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:14:17,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210674131] [2022-04-28 13:14:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210674131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:17,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:14:17,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371315039] [2022-04-28 13:14:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 13:14:17,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:17,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:14:17,347 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,488 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 13:14:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:14:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 13:14:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 13:14:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 13:14:17,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 13:14:17,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,533 INFO L225 Difference]: With dead ends: 46 [2022-04-28 13:14:17,533 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 13:14:17,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:14:17,535 INFO L413 NwaCegarLoop]: 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-28 13:14:17,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 13:14:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 13:14:17,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:17,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,543 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,543 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,545 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 13:14:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:14:17,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 13:14:17,546 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 13:14:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,548 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 13:14:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:14:17,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:17,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 13:14:17,550 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 13:14:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:17,550 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 13:14:17,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:14:17,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 13:14:17,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:14:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 13:14:17,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:17,582 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:17,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 13:14:17,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-28 13:14:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272550193] [2022-04-28 13:14:17,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-28 13:14:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:17,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088470342] [2022-04-28 13:14:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:14:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:17,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 13:14:17,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:14:17,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 13:14:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 13:14:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:17,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 13:14:17,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 13:14:17,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:14:17,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:14:17,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:14:17,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 13:14:17,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:14:17,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 13:14:17,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-28 13:14:17,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:14:17,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:14:17,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 100);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:14:17,638 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-28 13:14:17,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 13:14:17,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 13:14:17,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:14:17,639 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:14:17,640 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:14:17,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:14:17,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-28 13:14:17,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 13:14:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 13:14:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088470342] [2022-04-28 13:14:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088470342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:17,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:17,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272550193] [2022-04-28 13:14:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272550193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996363354] [2022-04-28 13:14:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 13:14:17,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:17,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:14:17,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:14:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:14:17,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:14:17,655 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:14:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,894 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-28 13:14:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:14:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 13:14:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:14:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:14:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:14:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:14:17,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 13:14:17,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,937 INFO L225 Difference]: With dead ends: 46 [2022-04-28 13:14:17,938 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 13:14:17,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:17,939 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:17,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:14:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 13:14:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-28 13:14:17,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:17,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,946 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,947 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,949 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 13:14:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 13:14:17,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 13:14:17,950 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 13:14:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:17,951 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 13:14:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 13:14:17,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:17,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:17,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:17,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:14:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 13:14:17,953 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-28 13:14:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:17,953 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 13:14:17,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:14:17,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 13:14:17,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 13:14:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 13:14:17,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:17,985 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:17,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 13:14:17,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-28 13:14:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:17,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699682453] [2022-04-28 13:14:17,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-28 13:14:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:17,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640370288] [2022-04-28 13:14:17,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:17,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:17,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44711443] [2022-04-28 13:14:17,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:17,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:18,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:18,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 13:14:18,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:18,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:18,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:14:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:18,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:18,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-28 13:14:18,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-28 13:14:18,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:14:18,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-28 13:14:18,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-28 13:14:18,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:18,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:18,263 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 < 100);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:18,263 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 13:14:18,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 13:14:18,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 13:14:18,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:14:18,264 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:18,265 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 13:14:18,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 13:14:18,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 13:14:18,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:14:18,266 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:18,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:18,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:18,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-28 13:14:18,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-28 13:14:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:14:18,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:14:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640370288] [2022-04-28 13:14:18,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44711443] [2022-04-28 13:14:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44711443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:18,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:18,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699682453] [2022-04-28 13:14:18,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699682453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:18,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:18,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727934884] [2022-04-28 13:14:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:18,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:14:18,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:18,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:14:18,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:18,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:14:18,283 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:14:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:18,435 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 13:14:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:14:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:14:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:14:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 13:14:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:14:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 13:14:18,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-28 13:14:18,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:18,523 INFO L225 Difference]: With dead ends: 65 [2022-04-28 13:14:18,523 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 13:14:18,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:14:18,524 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:18,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 13:14:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 13:14:18,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:18,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:18,540 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:18,541 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:18,544 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 13:14:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:14:18,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:18,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:18,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 13:14:18,546 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 13:14:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:18,549 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 13:14:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:14:18,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:18,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:18,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:18,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 13:14:18,552 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-28 13:14:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:18,553 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 13:14:18,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:14:18,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 13:14:18,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:14:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 13:14:18,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:18,597 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:18,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:18,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:18,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:18,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-28 13:14:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:18,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360953019] [2022-04-28 13:14:18,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-28 13:14:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:18,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748538646] [2022-04-28 13:14:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:18,824 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:18,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799348731] [2022-04-28 13:14:18,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:18,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:18,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:18,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:18,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 13:14:18,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:18,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:18,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:14:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:18,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:19,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-28 13:14:19,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:19,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:19,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:19,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:19,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:19,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,072 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,074 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,075 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,076 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,077 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,078 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:19,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:14:19,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1411#false} is VALID [2022-04-28 13:14:19,079 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-28 13:14:19,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-28 13:14:19,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-28 13:14:19,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-28 13:14:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 13:14:19,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:14:19,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748538646] [2022-04-28 13:14:19,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799348731] [2022-04-28 13:14:19,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799348731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:19,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:19,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:19,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:19,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360953019] [2022-04-28 13:14:19,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360953019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:19,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:19,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699927195] [2022-04-28 13:14:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:14:19,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:19,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:19,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:14:19,112 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:19,200 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-28 13:14:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:14:19,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:14:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:14:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:14:19,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 13:14:19,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:19,241 INFO L225 Difference]: With dead ends: 70 [2022-04-28 13:14:19,242 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 13:14:19,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:14:19,243 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:19,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 13:14:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 13:14:19,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:19,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:19,270 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:19,271 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:19,274 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 13:14:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 13:14:19,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:19,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:19,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 13:14:19,276 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 13:14:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:19,277 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 13:14:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 13:14:19,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:19,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:19,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:19,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:14:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-28 13:14:19,280 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-28 13:14:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:19,280 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-28 13:14:19,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:19,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-28 13:14:19,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-28 13:14:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 13:14:19,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:19,333 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:19,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:19,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 13:14:19,550 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-28 13:14:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:19,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299275355] [2022-04-28 13:14:19,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:14:19,551 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-28 13:14:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:19,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614573618] [2022-04-28 13:14:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:19,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:19,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037170090] [2022-04-28 13:14:19,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:19,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:19,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 13:14:19,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:19,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:19,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:14:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:19,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:21,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-28 13:14:21,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-28 13:14:21,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:14:21,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-28 13:14:21,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-28 13:14:21,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,181 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:14:21,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:14:21,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:14:21,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:14:21,182 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,182 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:14:21,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:14:21,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:14:21,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:14:21,182 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,183 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:14:21,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:14:21,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:14:21,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:14:21,183 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:14:21,185 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:21,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:21,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-28 13:14:21,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-28 13:14:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 13:14:21,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:14:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614573618] [2022-04-28 13:14:21,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037170090] [2022-04-28 13:14:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037170090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:21,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:21,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299275355] [2022-04-28 13:14:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299275355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:21,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521273853] [2022-04-28 13:14:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:21,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:14:21,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:21,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:21,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:21,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:21,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:14:21,204 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:21,370 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 13:14:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:14:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:14:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 13:14:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 13:14:21,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 13:14:21,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:21,409 INFO L225 Difference]: With dead ends: 76 [2022-04-28 13:14:21,409 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 13:14:21,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:14:21,409 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:21,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 13:14:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 13:14:21,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:21,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:21,443 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:21,444 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:21,445 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 13:14:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 13:14:21,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:21,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:21,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 13:14:21,446 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 13:14:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:21,448 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 13:14:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 13:14:21,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:21,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:21,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:21,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-28 13:14:21,450 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-28 13:14:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:21,450 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-28 13:14:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:21,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-28 13:14:21,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 13:14:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 13:14:21,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:21,509 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:21,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:21,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-28 13:14:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975793161] [2022-04-28 13:14:25,847 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:25,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-28 13:14:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:25,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572857125] [2022-04-28 13:14:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:25,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009615608] [2022-04-28 13:14:25,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:25,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:25,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 13:14:25,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:25,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:25,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:14:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:25,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:26,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 13:14:26,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:26,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:26,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:26,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:26,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:26,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,060 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,062 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,063 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,064 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,066 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:26,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 100);havoc #t~post6; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:14:26,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:14:26,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 13:14:26,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 13:14:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 13:14:26,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:26,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 13:14:26,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 13:14:26,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:14:26,204 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:14:26,204 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:14:26,205 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 100);havoc #t~post6; {2397#false} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 13:14:26,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2397#false} is VALID [2022-04-28 13:14:26,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:14:26,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,207 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #82#return; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:14:26,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:14:26,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:14:26,207 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:14:26,207 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #80#return; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:14:26,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:14:26,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:14:26,208 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:14:26,208 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #78#return; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:14:26,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:14:26,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:14:26,209 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:14:26,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 100)} is VALID [2022-04-28 13:14:26,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 99)} 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 99)} is VALID [2022-04-28 13:14:26,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 99)} call #t~ret7 := main(); {2604#(< ~counter~0 99)} is VALID [2022-04-28 13:14:26,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 99)} {2396#true} #92#return; {2604#(< ~counter~0 99)} is VALID [2022-04-28 13:14:26,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 99)} assume true; {2604#(< ~counter~0 99)} is VALID [2022-04-28 13:14:26,211 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 99)} is VALID [2022-04-28 13:14:26,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 13:14:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 13:14:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572857125] [2022-04-28 13:14:26,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009615608] [2022-04-28 13:14:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009615608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:14:26,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:14:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:14:26,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975793161] [2022-04-28 13:14:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975793161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:26,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851664208] [2022-04-28 13:14:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 13:14:26,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:26,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:14:26,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:26,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:14:26,231 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:14:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:26,351 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 13:14:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:14:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 13:14:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:14:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 13:14:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:14:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 13:14:26,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 13:14:26,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:26,405 INFO L225 Difference]: With dead ends: 90 [2022-04-28 13:14:26,405 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 13:14:26,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:14:26,406 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:26,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 13:14:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 13:14:26,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:26,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:26,438 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:26,438 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:26,440 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 13:14:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:14:26,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:26,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:26,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 13:14:26,441 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 13:14:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:26,443 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 13:14:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:14:26,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:26,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:26,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:26,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:14:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-28 13:14:26,445 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-28 13:14:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:26,445 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-28 13:14:26,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:14:26,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-28 13:14:26,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:14:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 13:14:26,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:26,523 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:26,541 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-28 13:14:26,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:26,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:26,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-28 13:14:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:26,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587628236] [2022-04-28 13:14:29,028 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:29,028 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-28 13:14:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:29,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424665906] [2022-04-28 13:14:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:29,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:29,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989001829] [2022-04-28 13:14:29,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:29,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:29,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:29,045 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:29,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 13:14:29,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:29,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:29,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:14:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:29,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:29,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 13:14:29,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 13:14:29,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 13:14:29,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 13:14:29,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,258 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 < 100);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,259 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,260 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,260 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,260 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:29,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:14:29,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:14:29,262 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 < 100);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:14:29,262 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,263 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:14:29,263 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,263 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:14:29,264 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:29,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:29,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 13:14:29,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 13:14:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:14:29,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:29,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 13:14:29,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 13:14:29,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:29,404 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:29,404 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,405 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,405 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,406 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 100);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,409 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,409 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,410 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,411 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:14:29,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:14:29,411 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:14:29,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 100);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:14:29,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 13:14:29,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 13:14:29,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:14:29,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 13:14:29,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 13:14:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 13:14:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424665906] [2022-04-28 13:14:29,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989001829] [2022-04-28 13:14:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989001829] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 13:14:29,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 13:14:29,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 13:14:29,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:29,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587628236] [2022-04-28 13:14:29,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587628236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:29,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:29,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:14:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213436701] [2022-04-28 13:14:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 13:14:29,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:29,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:29,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:29,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:14:29,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:14:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:14:29,435 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:33,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:14:35,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:14:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:35,871 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 13:14:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:14:35,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 13:14:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:14:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:14:35,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 13:14:35,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:35,918 INFO L225 Difference]: With dead ends: 78 [2022-04-28 13:14:35,918 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 13:14:35,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:14:35,919 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:35,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 104 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 13:14:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 13:14:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-28 13:14:35,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:35,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:14:35,958 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:14:35,958 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:14:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:35,961 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 13:14:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 13:14:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:35,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 13:14:35,961 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 13:14:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:35,963 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 13:14:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 13:14:35,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:35,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:35,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:35,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:14:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 13:14:35,965 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-28 13:14:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:35,966 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 13:14:35,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:14:35,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-28 13:14:36,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 13:14:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 13:14:36,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:36,046 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:36,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:36,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:36,256 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-28 13:14:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:36,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425870301] [2022-04-28 13:14:40,387 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:40,387 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-28 13:14:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:40,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4179851] [2022-04-28 13:14:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:40,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:40,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735100418] [2022-04-28 13:14:40,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:40,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:40,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 13:14:40,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:40,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:40,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:14:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:40,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:40,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 13:14:40,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:40,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:40,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:40,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:40,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:40,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,697 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,698 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,700 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,701 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,703 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:40,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,704 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,706 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,706 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,707 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,708 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,709 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:40,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-28 13:14:40,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {3770#false} is VALID [2022-04-28 13:14:40,710 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:14:40,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:14:40,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 13:14:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 13:14:40,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:40,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 13:14:40,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 13:14:40,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:14:40,938 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:14:40,938 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 13:14:40,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,938 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {3770#false} is VALID [2022-04-28 13:14:40,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:14:40,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 100)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,940 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #82#return; {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,940 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,943 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #80#return; {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,943 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,943 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #78#return; {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 100)} is VALID [2022-04-28 13:14:40,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,946 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #82#return; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,946 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #80#return; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #78#return; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:14:40,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:14:40,948 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:14:40,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 99)} is VALID [2022-04-28 13:14:40,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 13:14:40,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 98)} call #t~ret7 := main(); {4075#(< ~counter~0 98)} is VALID [2022-04-28 13:14:40,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 98)} {3769#true} #92#return; {4075#(< ~counter~0 98)} is VALID [2022-04-28 13:14:40,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 98)} assume true; {4075#(< ~counter~0 98)} is VALID [2022-04-28 13:14:40,950 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 98)} is VALID [2022-04-28 13:14:40,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 13:14:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 13:14:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4179851] [2022-04-28 13:14:40,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735100418] [2022-04-28 13:14:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735100418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:14:40,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:14:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:14:40,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425870301] [2022-04-28 13:14:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425870301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:40,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124736657] [2022-04-28 13:14:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 13:14:40,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:40,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:40,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:40,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:14:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:14:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:40,979 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:41,201 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 13:14:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:14:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 13:14:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 13:14:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 13:14:41,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-28 13:14:41,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:41,263 INFO L225 Difference]: With dead ends: 104 [2022-04-28 13:14:41,263 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 13:14:41,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:41,264 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:41,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 13:14:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 13:14:41,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:41,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:41,333 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:41,335 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 13:14:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 13:14:41,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:41,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:41,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 13:14:41,336 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 13:14:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:41,337 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 13:14:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 13:14:41,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:41,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:41,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:41,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-28 13:14:41,340 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-28 13:14:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:41,340 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-28 13:14:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:41,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-28 13:14:41,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-28 13:14:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 13:14:41,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:41,429 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:41,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:41,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:41,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-28 13:14:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:41,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457857650] [2022-04-28 13:14:45,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:45,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-28 13:14:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090626002] [2022-04-28 13:14:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:45,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:45,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665016192] [2022-04-28 13:14:45,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:14:45,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:45,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:45,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:45,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 13:14:45,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:14:45,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:45,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:14:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:45,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:45,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 13:14:45,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:45,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:45,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:45,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:45,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {4678#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:45,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {4678#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,994 INFO L272 TraceCheckUtils]: 8: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,996 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,996 INFO L272 TraceCheckUtils]: 13: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,998 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,998 INFO L272 TraceCheckUtils]: 18: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:45,999 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:46,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {4694#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:46,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {4694#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,001 INFO L272 TraceCheckUtils]: 26: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,002 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,003 INFO L272 TraceCheckUtils]: 31: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,004 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,005 INFO L272 TraceCheckUtils]: 36: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,006 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:46,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4804#(<= |main_#t~post5| 2)} is VALID [2022-04-28 13:14:46,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {4671#false} is VALID [2022-04-28 13:14:46,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 13:14:46,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 100);havoc #t~post6; {4671#false} is VALID [2022-04-28 13:14:46,007 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:14:46,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 13:14:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 13:14:46,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:46,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 13:14:46,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 13:14:46,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:14:46,239 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:14:46,240 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,240 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 100);havoc #t~post6; {4671#false} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 13:14:46,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4671#false} is VALID [2022-04-28 13:14:46,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4874#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:14:46,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,242 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #82#return; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,242 INFO L272 TraceCheckUtils]: 36: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,242 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #80#return; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L272 TraceCheckUtils]: 31: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #78#return; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,243 INFO L272 TraceCheckUtils]: 26: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {4878#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4878#(< ~counter~0 100)} is VALID [2022-04-28 13:14:46,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {4933#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,247 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #82#return; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,248 INFO L272 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,248 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #80#return; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L272 TraceCheckUtils]: 13: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #78#return; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:14:46,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {4933#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(< ~counter~0 99)} is VALID [2022-04-28 13:14:46,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 13:14:46,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 98)} call #t~ret7 := main(); {4988#(< ~counter~0 98)} is VALID [2022-04-28 13:14:46,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 98)} {4670#true} #92#return; {4988#(< ~counter~0 98)} is VALID [2022-04-28 13:14:46,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 98)} assume true; {4988#(< ~counter~0 98)} is VALID [2022-04-28 13:14:46,267 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 98)} is VALID [2022-04-28 13:14:46,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 13:14:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 13:14:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:46,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090626002] [2022-04-28 13:14:46,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:46,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665016192] [2022-04-28 13:14:46,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665016192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:14:46,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:14:46,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:14:46,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457857650] [2022-04-28 13:14:46,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457857650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:46,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:46,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:14:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766556392] [2022-04-28 13:14:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 13:14:46,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:46,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:46,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:14:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:46,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:14:46,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:46,317 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:46,479 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-28 13:14:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:14:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 13:14:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 13:14:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 13:14:46,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 13:14:46,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:46,536 INFO L225 Difference]: With dead ends: 126 [2022-04-28 13:14:46,536 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 13:14:46,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:14:46,537 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:46,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:14:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 13:14:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 13:14:46,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:46,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:46,595 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:46,596 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:46,598 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 13:14:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:14:46,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:46,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:46,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 13:14:46,599 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 13:14:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:46,600 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 13:14:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:14:46,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:46,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:46,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:46,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:14:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-28 13:14:46,602 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-28 13:14:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:46,603 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-28 13:14:46,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:14:46,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-28 13:14:46,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:14:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 13:14:46,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:46,691 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:46,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:46,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:46,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-28 13:14:46,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:46,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777893273] [2022-04-28 13:14:51,007 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:51,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-28 13:14:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:51,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734942410] [2022-04-28 13:14:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:51,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:51,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787241670] [2022-04-28 13:14:51,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:51,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:51,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:51,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 13:14:51,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:51,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:51,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:14:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:51,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:51,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 13:14:51,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:51,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:51,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:51,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:51,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {5645#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:14:51,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,368 INFO L272 TraceCheckUtils]: 8: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,369 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,372 INFO L272 TraceCheckUtils]: 18: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,373 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:14:51,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,375 INFO L272 TraceCheckUtils]: 26: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,376 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,377 INFO L272 TraceCheckUtils]: 31: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,378 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,380 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:14:51,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {5716#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {5771#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,381 INFO L272 TraceCheckUtils]: 44: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,382 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,383 INFO L272 TraceCheckUtils]: 49: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,384 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {5771#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,385 INFO L290 TraceCheckUtils]: 55: Hoare triple {5771#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:14:51,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {5771#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5814#(<= |main_#t~post6| 3)} is VALID [2022-04-28 13:14:51,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 100);havoc #t~post6; {5638#false} is VALID [2022-04-28 13:14:51,386 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 13:14:51,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 13:14:51,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 13:14:51,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 13:14:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 13:14:51,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:51,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 13:14:51,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 13:14:51,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 13:14:51,668 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 13:14:51,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {5638#false} is VALID [2022-04-28 13:14:51,669 INFO L290 TraceCheckUtils]: 56: Hoare triple {5846#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5842#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:14:51,669 INFO L290 TraceCheckUtils]: 55: Hoare triple {5846#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5846#(< ~counter~0 100)} is VALID [2022-04-28 13:14:51,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {5846#(< ~counter~0 100)} 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 100)} is VALID [2022-04-28 13:14:51,670 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 100)} #86#return; {5846#(< ~counter~0 100)} is VALID [2022-04-28 13:14:51,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,670 INFO L272 TraceCheckUtils]: 49: Hoare triple {5846#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,671 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 100)} #84#return; {5846#(< ~counter~0 100)} is VALID [2022-04-28 13:14:51,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,671 INFO L272 TraceCheckUtils]: 44: Hoare triple {5846#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {5846#(< ~counter~0 100)} is VALID [2022-04-28 13:14:51,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 100)} is VALID [2022-04-28 13:14:51,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 99)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,673 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #82#return; {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,673 INFO L272 TraceCheckUtils]: 36: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,674 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #80#return; {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,674 INFO L272 TraceCheckUtils]: 31: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,675 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #78#return; {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,675 INFO L272 TraceCheckUtils]: 26: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {5889#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5889#(< ~counter~0 99)} is VALID [2022-04-28 13:14:51,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,676 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #82#return; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L272 TraceCheckUtils]: 18: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #80#return; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,678 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #78#return; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:14:51,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:14:51,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:14:51,678 INFO L272 TraceCheckUtils]: 8: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:14:51,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {5944#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {5999#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5944#(< ~counter~0 98)} is VALID [2022-04-28 13:14:51,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {5999#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 13:14:51,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 97)} call #t~ret7 := main(); {5999#(< ~counter~0 97)} is VALID [2022-04-28 13:14:51,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 97)} {5637#true} #92#return; {5999#(< ~counter~0 97)} is VALID [2022-04-28 13:14:51,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 97)} assume true; {5999#(< ~counter~0 97)} is VALID [2022-04-28 13:14:51,685 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 97)} is VALID [2022-04-28 13:14:51,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 13:14:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:14:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:51,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734942410] [2022-04-28 13:14:51,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787241670] [2022-04-28 13:14:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787241670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:14:51,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:14:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:14:51,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777893273] [2022-04-28 13:14:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777893273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:51,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:14:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462782605] [2022-04-28 13:14:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 13:14:51,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:51,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:14:51,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:51,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:14:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:14:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:14:51,722 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:14:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:52,003 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-28 13:14:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:14:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 13:14:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:14:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 13:14:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:14:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 13:14:52,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 13:14:52,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:52,089 INFO L225 Difference]: With dead ends: 145 [2022-04-28 13:14:52,089 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 13:14:52,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:14:52,090 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:52,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:14:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 13:14:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 13:14:52,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:52,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:14:52,170 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:14:52,170 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:14:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:52,172 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 13:14:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 13:14:52,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:52,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:52,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 13:14:52,173 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 13:14:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:52,176 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 13:14:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 13:14:52,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:52,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:52,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:52,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:14:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-28 13:14:52,180 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-28 13:14:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:52,181 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-28 13:14:52,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:14:52,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-28 13:14:52,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-28 13:14:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 13:14:52,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:52,305 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:52,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 13:14:52,521 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-28 13:14:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:52,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321764526] [2022-04-28 13:14:54,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:14:54,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:14:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-28 13:14:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:14:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556426376] [2022-04-28 13:14:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:14:54,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:14:54,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:14:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939178714] [2022-04-28 13:14:54,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:14:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:14:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:14:54,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:14:54,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 13:14:54,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:14:54,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:14:54,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 13:14:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:14:54,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:14:55,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 13:14:55,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 13:14:55,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 13:14:55,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 13:14:55,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,143 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 < 100);havoc #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,143 INFO L272 TraceCheckUtils]: 8: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,144 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,144 INFO L272 TraceCheckUtils]: 13: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,145 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,145 INFO L272 TraceCheckUtils]: 18: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,146 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,161 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 < 100);havoc #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,161 INFO L272 TraceCheckUtils]: 26: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,162 INFO L272 TraceCheckUtils]: 31: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,162 INFO L272 TraceCheckUtils]: 36: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,163 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,164 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 < 100);havoc #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,164 INFO L272 TraceCheckUtils]: 44: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,165 INFO L272 TraceCheckUtils]: 49: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:55,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:55,166 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:14:55,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:14:55,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:14:55,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:14:55,168 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 < 100);havoc #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:14:55,168 INFO L272 TraceCheckUtils]: 58: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:55,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:55,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 13:14:55,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 13:14:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:14:55,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:14:56,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 13:14:56,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 13:14:56,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:14:56,283 INFO L272 TraceCheckUtils]: 58: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:14:56,283 INFO L290 TraceCheckUtils]: 57: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:14:56,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:14:56,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:14:56,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,310 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,311 INFO L272 TraceCheckUtils]: 49: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,311 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,312 INFO L272 TraceCheckUtils]: 44: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,317 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 < 100);havoc #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,320 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,321 INFO L272 TraceCheckUtils]: 36: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,321 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,322 INFO L272 TraceCheckUtils]: 31: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,322 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,323 INFO L272 TraceCheckUtils]: 26: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,324 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 < 100);havoc #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:14:56,332 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,332 INFO L272 TraceCheckUtils]: 18: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,333 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,333 INFO L272 TraceCheckUtils]: 13: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,333 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:14:56,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:14:56,334 INFO L272 TraceCheckUtils]: 8: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:14:56,335 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 < 100);havoc #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:14:56,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 13:14:56,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 13:14:56,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:14:56,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 13:14:56,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 13:14:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:14:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:14:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556426376] [2022-04-28 13:14:56,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:14:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939178714] [2022-04-28 13:14:56,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939178714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:14:56,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:14:56,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 13:14:56,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:14:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321764526] [2022-04-28 13:14:56,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321764526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:14:56,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:14:56,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:14:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988141496] [2022-04-28 13:14:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:14:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 13:14:56,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:14:56,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:14:56,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:14:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:14:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:14:56,371 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:14:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:56,992 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-28 13:14:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 13:14:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 13:14:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:14:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:14:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 13:14:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:14:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 13:14:56,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-28 13:14:57,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:57,089 INFO L225 Difference]: With dead ends: 181 [2022-04-28 13:14:57,089 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 13:14:57,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 13:14:57,090 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:14:57,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:14:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 13:14:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 13:14:57,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:14:57,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:14:57,179 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:14:57,179 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:14:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:57,181 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 13:14:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 13:14:57,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:57,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:57,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 13:14:57,182 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 13:14:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:14:57,185 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 13:14:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 13:14:57,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:14:57,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:14:57,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:14:57,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:14:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:14:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-28 13:14:57,188 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-28 13:14:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:14:57,188 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-28 13:14:57,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:14:57,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-28 13:14:57,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:14:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-28 13:14:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 13:14:57,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:14:57,340 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:14:57,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 13:14:57,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 13:14:57,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:14:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:14:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-28 13:14:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:14:57,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924903839] [2022-04-28 13:15:01,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:15:01,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:15:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-28 13:15:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:15:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145620073] [2022-04-28 13:15:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:15:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:15:01,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:15:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955737613] [2022-04-28 13:15:01,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:15:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:15:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:15:01,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:15:01,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 13:15:01,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:15:01,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:15:01,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 13:15:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:15:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:15:03,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-28 13:15:03,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {8115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8115#true} is VALID [2022-04-28 13:15:03,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {8115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 100);havoc #t~post5; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L272 TraceCheckUtils]: 13: Hoare triple {8115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:03,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,757 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8115#true} #80#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:15:03,757 INFO L272 TraceCheckUtils]: 18: Hoare triple {8173#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,757 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8115#true} {8173#(= main_~A~0 main_~r~0)} #82#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:15:03,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {8173#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:15:03,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:15:03,759 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 < 100);havoc #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:15:03,759 INFO L272 TraceCheckUtils]: 26: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:03,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,760 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #78#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,760 INFO L272 TraceCheckUtils]: 31: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,761 INFO L272 TraceCheckUtils]: 36: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,762 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,763 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 < 100);havoc #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,763 INFO L272 TraceCheckUtils]: 44: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,764 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,764 INFO L272 TraceCheckUtils]: 49: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:15:03,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:15:03,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:15:03,765 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} is VALID [2022-04-28 13:15:03,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:15:03,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:15:03,767 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 < 100);havoc #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:15:03,767 INFO L272 TraceCheckUtils]: 58: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:15:03,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:03,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:03,770 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} is VALID [2022-04-28 13:15:03,771 INFO L272 TraceCheckUtils]: 63: Hoare triple {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:15:03,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:03,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-28 13:15:03,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-28 13:15:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-28 13:15:03,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:15:19,982 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 13:15:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:15:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145620073] [2022-04-28 13:15:36,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:15:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955737613] [2022-04-28 13:15:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955737613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 13:15:36,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 13:15:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 13:15:36,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:15:36,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924903839] [2022-04-28 13:15:36,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924903839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:15:36,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:15:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:15:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994774667] [2022-04-28 13:15:36,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:15:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 13:15:36,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:15:36,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:15:36,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:36,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:15:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:36,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:15:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:15:36,149 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:15:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:37,120 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-28 13:15:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:15:37,120 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 13:15:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:15:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:15:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 13:15:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:15:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 13:15:37,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-28 13:15:37,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:37,236 INFO L225 Difference]: With dead ends: 188 [2022-04-28 13:15:37,236 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 13:15:37,237 INFO L412 NwaCegarLoop]: 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-28 13:15:37,238 INFO L413 NwaCegarLoop]: 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-28 13:15:37,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-04-28 13:15:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 13:15:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 13:15:37,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:15:37,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:37,358 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:37,358 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:37,361 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 13:15:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 13:15:37,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:37,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:37,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 13:15:37,363 INFO L87 Difference]: Start difference. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 13:15:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:37,367 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 13:15:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 13:15:37,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:37,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:37,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:15:37,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:15:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-28 13:15:37,371 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-28 13:15:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:15:37,372 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-28 13:15:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:15:37,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-28 13:15:37,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-28 13:15:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 13:15:37,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:15:37,641 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:15:37,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 13:15:37,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 13:15:37,857 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:15:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:15:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-28 13:15:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:37,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634898780] [2022-04-28 13:15:40,357 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:15:40,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:15:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-28 13:15:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:15:40,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30300920] [2022-04-28 13:15:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:15:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:15:40,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:15:40,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098449929] [2022-04-28 13:15:40,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:15:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:15:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:15:40,385 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:15:40,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 13:15:40,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:15:40,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:15:40,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 13:15:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:15:40,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:15:41,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 13:15:41,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 13:15:41,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 13:15:41,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 13:15:41,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,096 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 < 100);havoc #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,097 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,097 INFO L272 TraceCheckUtils]: 13: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:41,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,098 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,098 INFO L272 TraceCheckUtils]: 18: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,099 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,101 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 < 100);havoc #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,101 INFO L272 TraceCheckUtils]: 26: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,101 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,102 INFO L272 TraceCheckUtils]: 31: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,102 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,102 INFO L272 TraceCheckUtils]: 36: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,103 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,104 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 < 100);havoc #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,104 INFO L272 TraceCheckUtils]: 44: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,105 INFO L272 TraceCheckUtils]: 49: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:41,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:41,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:41,106 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:15:41,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,108 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 < 100);havoc #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,108 INFO L272 TraceCheckUtils]: 58: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:41,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,110 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,110 INFO L272 TraceCheckUtils]: 63: Hoare triple {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:41,110 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:41,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:41,111 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-28 13:15:41,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-28 13:15:41,112 INFO L272 TraceCheckUtils]: 69: Hoare triple {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:15:41,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:41,113 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 13:15:41,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 13:15:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 13:15:41,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:15:48,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 13:15:48,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 13:15:48,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:15:48,494 INFO L272 TraceCheckUtils]: 69: Hoare triple {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:15:48,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:15:48,496 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #86#return; {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:15:48,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:48,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:48,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:15:48,497 INFO L272 TraceCheckUtils]: 63: Hoare triple {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,498 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9367#true} #84#return; {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:15:48,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:48,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:15:48,499 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:15:48,500 INFO L272 TraceCheckUtils]: 58: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 100);havoc #t~post6; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {9367#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {9367#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L272 TraceCheckUtils]: 49: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L272 TraceCheckUtils]: 44: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 100);havoc #t~post6; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L272 TraceCheckUtils]: 36: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,502 INFO L272 TraceCheckUtils]: 31: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,502 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 13:15:48,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L272 TraceCheckUtils]: 26: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 100);havoc #t~post5; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {9367#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L272 TraceCheckUtils]: 18: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 100);havoc #t~post5; {9367#true} is VALID [2022-04-28 13:15:48,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 13:15:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-28 13:15:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:15:48,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30300920] [2022-04-28 13:15:48,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:15:48,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098449929] [2022-04-28 13:15:48,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098449929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:15:48,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:15:48,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-28 13:15:48,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:15:48,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634898780] [2022-04-28 13:15:48,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634898780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:15:48,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:15:48,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:15:48,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663928467] [2022-04-28 13:15:48,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:15:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:15:48,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:15:48,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:48,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:15:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:15:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:15:48,561 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:49,463 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-28 13:15:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:15:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:15:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:15:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:15:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:15:49,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 13:15:49,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:49,562 INFO L225 Difference]: With dead ends: 186 [2022-04-28 13:15:49,562 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 13:15:49,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:15:49,565 INFO L413 NwaCegarLoop]: 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-28 13:15:49,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 13:15:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 13:15:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-28 13:15:49,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:15:49,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:49,657 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:49,658 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:49,661 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 13:15:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:15:49,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:49,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:49,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 13:15:49,662 INFO L87 Difference]: Start difference. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 13:15:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:49,664 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 13:15:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:15:49,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:49,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:49,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:15:49,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:15:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-28 13:15:49,667 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-28 13:15:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:15:49,668 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-28 13:15:49,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:49,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-28 13:15:49,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:15:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 13:15:49,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:15:49,854 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:15:49,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 13:15:50,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 13:15:50,071 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:15:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:15:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-28 13:15:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:50,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954035355] [2022-04-28 13:15:53,038 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:15:53,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:15:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-28 13:15:53,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:15:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035317602] [2022-04-28 13:15:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:15:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:15:53,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:15:53,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061835133] [2022-04-28 13:15:53,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:15:53,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:15:53,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:15:53,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:15:53,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 13:15:53,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 13:15:53,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:15:53,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:15:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:15:53,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:15:53,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 13:15:53,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:53,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:53,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:53,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:53,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {10720#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:53,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {10720#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,367 INFO L272 TraceCheckUtils]: 8: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,369 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,369 INFO L272 TraceCheckUtils]: 13: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,370 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,371 INFO L272 TraceCheckUtils]: 18: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,372 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {10736#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:53,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {10736#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {10791#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,374 INFO L272 TraceCheckUtils]: 26: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,375 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,376 INFO L272 TraceCheckUtils]: 31: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,377 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,379 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {10791#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:53,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {10791#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {10846#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,380 INFO L272 TraceCheckUtils]: 44: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,382 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,382 INFO L272 TraceCheckUtils]: 49: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,383 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,384 INFO L272 TraceCheckUtils]: 54: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,385 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {10846#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:53,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {10846#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10901#(<= |main_#t~post5| 3)} is VALID [2022-04-28 13:15:53,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {10713#false} is VALID [2022-04-28 13:15:53,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 13:15:53,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 100);havoc #t~post6; {10713#false} is VALID [2022-04-28 13:15:53,386 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:15:53,386 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 13:15:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 13:15:53,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,681 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 100);havoc #t~post6; {10713#false} is VALID [2022-04-28 13:15:53,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 13:15:53,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {10713#false} is VALID [2022-04-28 13:15:53,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {10975#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10971#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:15:53,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {10975#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,683 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #82#return; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,683 INFO L272 TraceCheckUtils]: 54: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #80#return; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L272 TraceCheckUtils]: 49: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #78#return; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,685 INFO L272 TraceCheckUtils]: 44: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {11030#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(< ~counter~0 100)} is VALID [2022-04-28 13:15:53,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,686 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #82#return; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,686 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,687 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #80#return; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,687 INFO L272 TraceCheckUtils]: 31: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,688 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #78#return; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,688 INFO L272 TraceCheckUtils]: 26: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {11030#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {11085#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(< ~counter~0 99)} is VALID [2022-04-28 13:15:53,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {11085#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,689 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #82#return; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L272 TraceCheckUtils]: 18: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #80#return; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,690 INFO L272 TraceCheckUtils]: 13: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,691 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #78#return; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:15:53,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:15:53,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:15:53,691 INFO L272 TraceCheckUtils]: 8: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:15:53,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(< ~counter~0 98)} is VALID [2022-04-28 13:15:53,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 13:15:53,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 97)} call #t~ret7 := main(); {11140#(< ~counter~0 97)} is VALID [2022-04-28 13:15:53,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 97)} {10712#true} #92#return; {11140#(< ~counter~0 97)} is VALID [2022-04-28 13:15:53,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 97)} assume true; {11140#(< ~counter~0 97)} is VALID [2022-04-28 13:15:53,694 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 97)} is VALID [2022-04-28 13:15:53,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 13:15:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 13:15:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:15:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035317602] [2022-04-28 13:15:53,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:15:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061835133] [2022-04-28 13:15:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061835133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:15:53,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:15:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:15:53,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:15:53,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954035355] [2022-04-28 13:15:53,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954035355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:15:53,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:15:53,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:15:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167947782] [2022-04-28 13:15:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:15:53,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:15:53,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:15:53,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:53,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:15:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:15:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:15:53,733 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:53,945 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-28 13:15:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:15:53,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:15:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:15:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 13:15:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 13:15:53,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-28 13:15:54,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:54,017 INFO L225 Difference]: With dead ends: 170 [2022-04-28 13:15:54,018 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 13:15:54,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:15:54,019 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:15:54,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:15:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 13:15:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 13:15:54,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:15:54,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:54,111 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:54,111 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:54,114 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 13:15:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:15:54,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:54,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:54,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 13:15:54,116 INFO L87 Difference]: Start difference. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 13:15:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:54,119 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 13:15:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:15:54,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:54,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:54,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:15:54,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:15:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:15:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-28 13:15:54,121 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-28 13:15:54,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:15:54,123 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-28 13:15:54,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:15:54,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-28 13:15:54,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:15:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 13:15:54,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:15:54,279 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:15:54,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 13:15:54,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 13:15:54,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:15:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:15:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-28 13:15:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [56733421] [2022-04-28 13:15:58,109 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:15:58,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:15:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-28 13:15:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:15:58,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982031783] [2022-04-28 13:15:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:15:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:15:58,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:15:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928057351] [2022-04-28 13:15:58,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:15:58,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:15:58,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:15:58,120 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:15:58,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 13:15:58,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:15:58,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:15:58,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:15:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:15:58,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:15:58,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 13:15:58,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:58,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:58,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:58,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:58,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {12039#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:15:58,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {12039#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {12055#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,516 INFO L272 TraceCheckUtils]: 8: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,517 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,517 INFO L272 TraceCheckUtils]: 13: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,519 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,519 INFO L272 TraceCheckUtils]: 18: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,520 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:15:58,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,522 INFO L272 TraceCheckUtils]: 26: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,523 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,523 INFO L272 TraceCheckUtils]: 31: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,525 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,525 INFO L272 TraceCheckUtils]: 36: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,526 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {12110#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:15:58,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {12110#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {12165#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,528 INFO L272 TraceCheckUtils]: 44: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,529 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,529 INFO L272 TraceCheckUtils]: 49: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,531 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,531 INFO L272 TraceCheckUtils]: 54: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,532 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:15:58,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {12220#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,534 INFO L272 TraceCheckUtils]: 62: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,535 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,536 INFO L272 TraceCheckUtils]: 67: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,537 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {12220#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {12220#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:15:58,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {12220#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12263#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:15:58,538 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {12032#false} is VALID [2022-04-28 13:15:58,538 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 13:15:58,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 13:15:58,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 13:15:58,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 13:15:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:15:58,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:15:58,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 13:15:58,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 13:15:58,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 13:15:58,846 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 13:15:58,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {12032#false} is VALID [2022-04-28 13:15:58,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {12295#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12291#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:15:58,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {12295#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12295#(< ~counter~0 100)} is VALID [2022-04-28 13:15:58,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {12295#(< ~counter~0 100)} 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 100)} is VALID [2022-04-28 13:15:58,847 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 100)} #86#return; {12295#(< ~counter~0 100)} is VALID [2022-04-28 13:15:58,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,847 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,847 INFO L272 TraceCheckUtils]: 67: Hoare triple {12295#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,848 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 100)} #84#return; {12295#(< ~counter~0 100)} is VALID [2022-04-28 13:15:58,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,848 INFO L272 TraceCheckUtils]: 62: Hoare triple {12295#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {12295#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {12295#(< ~counter~0 100)} is VALID [2022-04-28 13:15:58,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {12338#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12295#(< ~counter~0 100)} is VALID [2022-04-28 13:15:58,849 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 99)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,849 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #82#return; {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L272 TraceCheckUtils]: 54: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #80#return; {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,850 INFO L272 TraceCheckUtils]: 49: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,851 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #78#return; {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,851 INFO L272 TraceCheckUtils]: 44: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {12338#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12338#(< ~counter~0 99)} is VALID [2022-04-28 13:15:58,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,852 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #82#return; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,852 INFO L272 TraceCheckUtils]: 36: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #80#return; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L272 TraceCheckUtils]: 31: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #78#return; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,854 INFO L272 TraceCheckUtils]: 26: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {12448#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12393#(< ~counter~0 98)} is VALID [2022-04-28 13:15:58,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {12448#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,855 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #82#return; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,855 INFO L272 TraceCheckUtils]: 18: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,855 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #80#return; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #78#return; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:15:58,856 INFO L272 TraceCheckUtils]: 8: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:15:58,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {12448#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {12503#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12448#(< ~counter~0 97)} is VALID [2022-04-28 13:15:58,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {12503#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 13:15:58,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 96)} call #t~ret7 := main(); {12503#(< ~counter~0 96)} is VALID [2022-04-28 13:15:58,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 96)} {12031#true} #92#return; {12503#(< ~counter~0 96)} is VALID [2022-04-28 13:15:58,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 96)} assume true; {12503#(< ~counter~0 96)} is VALID [2022-04-28 13:15:58,859 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 96)} is VALID [2022-04-28 13:15:58,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 13:15:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 13:15:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:15:58,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982031783] [2022-04-28 13:15:58,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:15:58,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928057351] [2022-04-28 13:15:58,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928057351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:15:58,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:15:58,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:15:58,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:15:58,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [56733421] [2022-04-28 13:15:58,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [56733421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:15:58,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:15:58,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:15:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612113069] [2022-04-28 13:15:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:15:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 13:15:58,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:15:58,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:15:58,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:58,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:15:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:15:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:15:58,905 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:15:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:59,248 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-28 13:15:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:15:59,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 13:15:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:15:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:15:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 13:15:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:15:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 13:15:59,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-28 13:15:59,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:59,330 INFO L225 Difference]: With dead ends: 181 [2022-04-28 13:15:59,330 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 13:15:59,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:15:59,330 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:15:59,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:15:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 13:15:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-28 13:15:59,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:15:59,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:59,488 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:59,489 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:59,491 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 13:15:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 13:15:59,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:59,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:59,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 13:15:59,492 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 13:15:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:15:59,495 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 13:15:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 13:15:59,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:15:59,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:15:59,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:15:59,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:15:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:15:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-28 13:15:59,498 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-28 13:15:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:15:59,498 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-28 13:15:59,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:15:59,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-28 13:15:59,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:15:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-28 13:15:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 13:15:59,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:15:59,682 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:15:59,700 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-28 13:15:59,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 13:15:59,883 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:15:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:15:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-28 13:15:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:15:59,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391030058] [2022-04-28 13:16:00,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:16:00,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:16:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-28 13:16:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:16:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874678123] [2022-04-28 13:16:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:16:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:16:00,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:16:00,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967241830] [2022-04-28 13:16:00,574 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:16:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:16:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:16:00,581 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:16:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 13:16:00,623 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:16:00,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:16:00,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 13:16:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:16:00,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:16:01,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 13:16:01,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 13:16:01,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 13:16:01,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 13:16:01,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,306 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 < 100);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,306 INFO L272 TraceCheckUtils]: 8: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,307 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,307 INFO L272 TraceCheckUtils]: 13: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,308 INFO L272 TraceCheckUtils]: 18: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,308 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,310 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 < 100);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,310 INFO L272 TraceCheckUtils]: 26: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,310 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,310 INFO L272 TraceCheckUtils]: 31: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,311 INFO L272 TraceCheckUtils]: 36: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,312 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,314 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 < 100);havoc #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,314 INFO L272 TraceCheckUtils]: 44: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,314 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #78#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,315 INFO L272 TraceCheckUtils]: 49: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,315 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #80#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,315 INFO L272 TraceCheckUtils]: 54: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:16:01,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:16:01,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:16:01,317 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #82#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,318 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 < 100);havoc #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,318 INFO L272 TraceCheckUtils]: 62: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,319 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #84#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,319 INFO L272 TraceCheckUtils]: 67: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:16:01,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:16:01,319 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:16:01,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:16:01,320 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #86#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:16:01,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:16:01,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:16:01,322 INFO L290 TraceCheckUtils]: 74: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:16:01,322 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 < 100);havoc #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:16:01,323 INFO L272 TraceCheckUtils]: 76: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:16:01,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:16:01,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 13:16:01,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 13:16:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:16:01,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:16:36,278 WARN L232 SmtUtils]: Spent 16.40s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 13:17:58,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 13:17:58,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 13:17:58,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:17:58,197 INFO L272 TraceCheckUtils]: 76: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:17:58,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:17:58,235 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L272 TraceCheckUtils]: 67: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,236 INFO L272 TraceCheckUtils]: 62: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,237 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 < 100);havoc #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,240 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #82#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:17:58,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:17:58,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:17:58,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:17:58,241 INFO L272 TraceCheckUtils]: 54: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,242 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #80#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:17:58,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,242 INFO L272 TraceCheckUtils]: 49: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,242 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #78#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:17:58,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,243 INFO L272 TraceCheckUtils]: 44: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,244 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 < 100);havoc #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:17:58,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:17:58,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:17:58,249 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,249 INFO L272 TraceCheckUtils]: 36: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L272 TraceCheckUtils]: 31: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,251 INFO L272 TraceCheckUtils]: 26: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 100);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,252 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,252 INFO L272 TraceCheckUtils]: 18: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,253 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,253 INFO L272 TraceCheckUtils]: 13: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,254 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:17:58,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:17:58,254 INFO L272 TraceCheckUtils]: 8: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:17:58,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 100);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:17:58,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 13:17:58,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 13:17:58,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:17:58,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 13:17:58,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 13:17:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:17:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:17:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874678123] [2022-04-28 13:17:58,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:17:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967241830] [2022-04-28 13:17:58,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967241830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:17:58,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:17:58,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-28 13:17:58,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:17:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391030058] [2022-04-28 13:17:58,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391030058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:17:58,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:17:58,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:17:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047239838] [2022-04-28 13:17:58,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:17:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 13:17:58,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:17:58,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:17:58,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:17:58,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:17:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:17:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:17:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 13:17:58,295 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:17:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:17:58,948 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-28 13:17:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:17:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 13:17:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:17:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:17:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:17:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:17:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:17:58,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 13:17:59,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:17:59,036 INFO L225 Difference]: With dead ends: 193 [2022-04-28 13:17:59,036 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 13:17:59,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=70, Invalid=235, Unknown=1, NotChecked=0, Total=306 [2022-04-28 13:17:59,036 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:17:59,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:17:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 13:17:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-28 13:17:59,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:17:59,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:17:59,175 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:17:59,175 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:17:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:17:59,178 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 13:17:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 13:17:59,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:17:59,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:17:59,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 13:17:59,179 INFO L87 Difference]: Start difference. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 13:17:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:17:59,181 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 13:17:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 13:17:59,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:17:59,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:17:59,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:17:59,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:17:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:17:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-28 13:17:59,194 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-28 13:17:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:17:59,195 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-28 13:17:59,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:17:59,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-28 13:17:59,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:17:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-28 13:17:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 13:17:59,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:17:59,470 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:17:59,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 13:17:59,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:17:59,684 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:17:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:17:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-28 13:17:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:17:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249476762] [2022-04-28 13:18:02,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:18:02,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:18:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-28 13:18:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:18:02,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261098988] [2022-04-28 13:18:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:18:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:18:02,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:18:02,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760215307] [2022-04-28 13:18:02,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:18:02,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:02,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:18:02,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:18:02,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 13:18:02,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:18:02,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:18:02,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 13:18:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:18:02,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:18:03,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 13:18:03,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 100);havoc #t~post5; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,781 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 13:18:03,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post5 < 100);havoc #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,782 INFO L272 TraceCheckUtils]: 26: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,783 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #78#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,783 INFO L272 TraceCheckUtils]: 31: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,783 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #80#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,783 INFO L272 TraceCheckUtils]: 36: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,784 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #82#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,786 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 < 100);havoc #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,786 INFO L272 TraceCheckUtils]: 44: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,787 INFO L272 TraceCheckUtils]: 49: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,787 INFO L272 TraceCheckUtils]: 54: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,788 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,789 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 < 100);havoc #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,789 INFO L272 TraceCheckUtils]: 62: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,790 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,790 INFO L272 TraceCheckUtils]: 67: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,791 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #86#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:18:03,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,792 INFO L290 TraceCheckUtils]: 73: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post6 < 100);havoc #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,793 INFO L272 TraceCheckUtils]: 76: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,793 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #84#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,793 INFO L272 TraceCheckUtils]: 81: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:03,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:03,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:03,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:03,794 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #86#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:18:03,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 13:18:03,794 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 13:18:03,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 13:18:03,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 13:18:03,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 13:18:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:03,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:18:04,021 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 13:18:04,022 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 13:18:04,022 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 13:18:04,022 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 13:18:04,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 13:18:04,022 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #86#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L272 TraceCheckUtils]: 81: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #84#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,024 INFO L272 TraceCheckUtils]: 76: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,024 INFO L290 TraceCheckUtils]: 75: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,024 INFO L290 TraceCheckUtils]: 74: Hoare triple {15404#(not (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {15404#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,026 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #86#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,026 INFO L272 TraceCheckUtils]: 67: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,026 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #84#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,027 INFO L272 TraceCheckUtils]: 62: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post6 < 100);havoc #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,028 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #82#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,028 INFO L272 TraceCheckUtils]: 54: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #80#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L272 TraceCheckUtils]: 49: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #78#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,030 INFO L272 TraceCheckUtils]: 44: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:18:04,031 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #82#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,032 INFO L272 TraceCheckUtils]: 36: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,032 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #80#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,032 INFO L272 TraceCheckUtils]: 31: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,033 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #78#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,033 INFO L272 TraceCheckUtils]: 26: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {15404#(not (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:18:04,034 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 100);havoc #t~post5; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 13:18:04,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 13:18:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:18:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261098988] [2022-04-28 13:18:04,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:18:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760215307] [2022-04-28 13:18:04,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760215307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:18:04,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:18:04,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 13:18:04,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:18:04,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249476762] [2022-04-28 13:18:04,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249476762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:18:04,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:18:04,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:18:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765486852] [2022-04-28 13:18:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:18:04,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 13:18:04,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:18:04,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:18:04,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:04,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:18:04,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:04,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:18:04,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:18:04,104 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:18:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:04,355 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-28 13:18:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:18:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 13:18:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:18:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:18:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 13:18:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:18:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 13:18:04,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 13:18:04,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:04,448 INFO L225 Difference]: With dead ends: 197 [2022-04-28 13:18:04,448 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 13:18:04,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:18:04,451 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:18:04,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:18:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 13:18:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-28 13:18:04,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:18:04,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:04,552 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:04,552 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:04,556 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 13:18:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 13:18:04,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:04,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:04,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 13:18:04,557 INFO L87 Difference]: Start difference. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 13:18:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:04,560 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 13:18:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 13:18:04,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:04,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:04,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:18:04,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:18:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-28 13:18:04,564 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-28 13:18:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:18:04,564 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-28 13:18:04,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:18:04,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-28 13:18:04,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-28 13:18:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 13:18:04,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:18:04,858 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:18:04,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 13:18:05,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:05,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:18:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:18:05,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-28 13:18:05,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:05,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [788105912] [2022-04-28 13:18:09,145 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:18:09,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:18:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-28 13:18:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:18:09,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245768217] [2022-04-28 13:18:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:18:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:18:09,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:18:09,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969944155] [2022-04-28 13:18:09,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:18:09,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:09,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:18:09,167 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:18:09,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 13:18:09,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:18:09,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:18:09,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:18:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:18:09,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:18:09,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 13:18:09,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:09,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:09,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:09,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:09,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {16796#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:09,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {16796#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {16812#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,593 INFO L272 TraceCheckUtils]: 8: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,594 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,594 INFO L272 TraceCheckUtils]: 13: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,596 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,596 INFO L272 TraceCheckUtils]: 18: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,597 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {16812#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:09,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {16812#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {16867#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,599 INFO L272 TraceCheckUtils]: 26: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,600 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,600 INFO L272 TraceCheckUtils]: 31: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,602 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,602 INFO L272 TraceCheckUtils]: 36: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,603 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {16867#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:09,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {16867#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {16922#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,605 INFO L272 TraceCheckUtils]: 44: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,606 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,606 INFO L272 TraceCheckUtils]: 49: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,608 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,608 INFO L272 TraceCheckUtils]: 54: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,609 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {16922#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:09,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {16922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {16977#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,611 INFO L272 TraceCheckUtils]: 62: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,612 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,612 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,612 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,613 INFO L272 TraceCheckUtils]: 67: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,613 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,614 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,615 INFO L272 TraceCheckUtils]: 72: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,616 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {16977#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:09,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {16977#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17032#(<= |main_#t~post5| 4)} is VALID [2022-04-28 13:18:09,617 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {16789#false} is VALID [2022-04-28 13:18:09,617 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 13:18:09,617 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 100);havoc #t~post6; {16789#false} is VALID [2022-04-28 13:18:09,617 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 13:18:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 13:18:09,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:18:09,966 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 13:18:09,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 13:18:09,966 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:18:09,966 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:18:09,966 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 13:18:09,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,966 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,967 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,967 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 100);havoc #t~post6; {16789#false} is VALID [2022-04-28 13:18:09,967 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 13:18:09,967 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {16789#false} is VALID [2022-04-28 13:18:09,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {17106#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17102#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:18:09,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {17106#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,968 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #82#return; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,969 INFO L272 TraceCheckUtils]: 72: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,969 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #80#return; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,969 INFO L272 TraceCheckUtils]: 67: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,970 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #78#return; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,970 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,970 INFO L272 TraceCheckUtils]: 62: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {17106#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {17161#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17106#(< ~counter~0 100)} is VALID [2022-04-28 13:18:09,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {17161#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,972 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #82#return; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,984 INFO L272 TraceCheckUtils]: 54: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #80#return; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L272 TraceCheckUtils]: 49: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #78#return; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,987 INFO L272 TraceCheckUtils]: 44: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {17161#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {17216#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17161#(< ~counter~0 99)} is VALID [2022-04-28 13:18:09,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {17216#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,988 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #82#return; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,988 INFO L272 TraceCheckUtils]: 36: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,989 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #80#return; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,989 INFO L272 TraceCheckUtils]: 31: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,989 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #78#return; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,990 INFO L272 TraceCheckUtils]: 26: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {17216#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {17271#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17216#(< ~counter~0 98)} is VALID [2022-04-28 13:18:09,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {17271#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,991 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #82#return; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L272 TraceCheckUtils]: 18: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #80#return; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,992 INFO L272 TraceCheckUtils]: 13: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,993 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #78#return; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:18:09,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:18:09,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:18:09,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:18:09,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {17271#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {17326#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17271#(< ~counter~0 97)} is VALID [2022-04-28 13:18:09,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {17326#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 13:18:09,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 96)} call #t~ret7 := main(); {17326#(< ~counter~0 96)} is VALID [2022-04-28 13:18:09,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 96)} {16788#true} #92#return; {17326#(< ~counter~0 96)} is VALID [2022-04-28 13:18:09,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 96)} assume true; {17326#(< ~counter~0 96)} is VALID [2022-04-28 13:18:09,995 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 96)} is VALID [2022-04-28 13:18:09,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 13:18:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:09,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:18:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245768217] [2022-04-28 13:18:09,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:18:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969944155] [2022-04-28 13:18:09,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969944155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:18:09,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:18:09,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:18:09,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:18:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [788105912] [2022-04-28 13:18:09,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [788105912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:18:09,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:18:09,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:18:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845452610] [2022-04-28 13:18:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:18:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 13:18:09,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:18:09,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:10,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:10,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:18:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:18:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:18:10,042 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:10,395 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-28 13:18:10,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:18:10,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 13:18:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:18:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 13:18:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 13:18:10,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-28 13:18:10,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:10,475 INFO L225 Difference]: With dead ends: 242 [2022-04-28 13:18:10,475 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 13:18:10,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:18:10,476 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:18:10,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:18:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 13:18:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 13:18:10,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:18:10,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:10,618 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:10,618 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:10,621 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 13:18:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:18:10,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:10,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:10,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 13:18:10,622 INFO L87 Difference]: Start difference. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 13:18:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:10,625 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 13:18:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:18:10,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:10,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:10,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:18:10,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:18:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:18:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-28 13:18:10,628 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-28 13:18:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:18:10,628 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-28 13:18:10,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:10,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-28 13:18:10,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:18:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 13:18:10,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:18:10,853 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:18:10,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 13:18:11,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:11,054 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:18:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:18:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-28 13:18:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:11,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843842160] [2022-04-28 13:18:14,298 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:18:14,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:18:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-28 13:18:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:18:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788206103] [2022-04-28 13:18:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:18:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:18:14,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:18:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828585268] [2022-04-28 13:18:14,309 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:18:14,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:18:14,311 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:18:14,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 13:18:14,394 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:18:14,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:18:14,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:18:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:18:14,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:18:14,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 13:18:14,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:14,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:14,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:14,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:14,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {18575#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:18:14,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {18575#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {18591#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,775 INFO L272 TraceCheckUtils]: 8: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,776 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,776 INFO L272 TraceCheckUtils]: 13: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,778 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,778 INFO L272 TraceCheckUtils]: 18: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,779 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {18591#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:18:14,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {18591#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {18646#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,781 INFO L272 TraceCheckUtils]: 26: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,782 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,782 INFO L272 TraceCheckUtils]: 31: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,784 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,784 INFO L272 TraceCheckUtils]: 36: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,785 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {18646#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:18:14,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {18646#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {18701#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,787 INFO L272 TraceCheckUtils]: 44: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,788 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,788 INFO L272 TraceCheckUtils]: 49: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,790 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,790 INFO L272 TraceCheckUtils]: 54: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,791 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,792 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:18:14,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {18701#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {18756#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,793 INFO L272 TraceCheckUtils]: 62: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,794 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,795 INFO L272 TraceCheckUtils]: 67: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,795 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,795 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,796 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,796 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,796 INFO L290 TraceCheckUtils]: 72: Hoare triple {18756#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {18756#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:18:14,797 INFO L290 TraceCheckUtils]: 74: Hoare triple {18756#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,797 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,798 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,799 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,800 INFO L272 TraceCheckUtils]: 81: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,800 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,800 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,801 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,801 INFO L290 TraceCheckUtils]: 86: Hoare triple {18799#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,801 INFO L290 TraceCheckUtils]: 87: Hoare triple {18799#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:18:14,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {18799#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18842#(<= |main_#t~post6| 5)} is VALID [2022-04-28 13:18:14,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {18568#false} is VALID [2022-04-28 13:18:14,802 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 13:18:14,802 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 13:18:14,802 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 13:18:14,802 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 13:18:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 296 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 13:18:14,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:18:15,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 13:18:15,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 13:18:15,184 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 13:18:15,184 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 13:18:15,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {18568#false} is VALID [2022-04-28 13:18:15,184 INFO L290 TraceCheckUtils]: 88: Hoare triple {18874#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18870#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:18:15,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {18874#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18874#(< ~counter~0 100)} is VALID [2022-04-28 13:18:15,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {18874#(< ~counter~0 100)} 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 100)} is VALID [2022-04-28 13:18:15,185 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 100)} #86#return; {18874#(< ~counter~0 100)} is VALID [2022-04-28 13:18:15,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,185 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L272 TraceCheckUtils]: 81: Hoare triple {18874#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 100)} #84#return; {18874#(< ~counter~0 100)} is VALID [2022-04-28 13:18:15,186 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,186 INFO L272 TraceCheckUtils]: 76: Hoare triple {18874#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {18874#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {18874#(< ~counter~0 100)} is VALID [2022-04-28 13:18:15,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {18917#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18874#(< ~counter~0 100)} is VALID [2022-04-28 13:18:15,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {18917#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18917#(< ~counter~0 99)} is VALID [2022-04-28 13:18:15,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {18917#(< ~counter~0 99)} 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 99)} is VALID [2022-04-28 13:18:15,188 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 99)} #86#return; {18917#(< ~counter~0 99)} is VALID [2022-04-28 13:18:15,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L272 TraceCheckUtils]: 67: Hoare triple {18917#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 99)} #84#return; {18917#(< ~counter~0 99)} is VALID [2022-04-28 13:18:15,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,189 INFO L272 TraceCheckUtils]: 62: Hoare triple {18917#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,190 INFO L290 TraceCheckUtils]: 61: Hoare triple {18917#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {18917#(< ~counter~0 99)} is VALID [2022-04-28 13:18:15,190 INFO L290 TraceCheckUtils]: 60: Hoare triple {18960#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18917#(< ~counter~0 99)} is VALID [2022-04-28 13:18:15,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 98)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,191 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #82#return; {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,191 INFO L272 TraceCheckUtils]: 54: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #80#return; {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L272 TraceCheckUtils]: 49: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #78#return; {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,193 INFO L272 TraceCheckUtils]: 44: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {18960#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {19015#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18960#(< ~counter~0 98)} is VALID [2022-04-28 13:18:15,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {19015#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,194 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #82#return; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,194 INFO L272 TraceCheckUtils]: 36: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,195 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #80#return; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,195 INFO L272 TraceCheckUtils]: 31: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,195 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #78#return; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,196 INFO L272 TraceCheckUtils]: 26: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {19015#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {19070#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19015#(< ~counter~0 97)} is VALID [2022-04-28 13:18:15,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {19070#(< ~counter~0 96)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,197 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #82#return; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,197 INFO L272 TraceCheckUtils]: 18: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,198 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #80#return; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,198 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #78#return; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:18:15,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:18:15,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:18:15,199 INFO L272 TraceCheckUtils]: 8: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:18:15,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {19070#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {19125#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19070#(< ~counter~0 96)} is VALID [2022-04-28 13:18:15,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {19125#(< ~counter~0 95)} 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 95)} is VALID [2022-04-28 13:18:15,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 95)} call #t~ret7 := main(); {19125#(< ~counter~0 95)} is VALID [2022-04-28 13:18:15,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 95)} {18567#true} #92#return; {19125#(< ~counter~0 95)} is VALID [2022-04-28 13:18:15,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 95)} assume true; {19125#(< ~counter~0 95)} is VALID [2022-04-28 13:18:15,203 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 95)} is VALID [2022-04-28 13:18:15,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 13:18:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:18:15,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788206103] [2022-04-28 13:18:15,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:18:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828585268] [2022-04-28 13:18:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828585268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:18:15,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:18:15,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 13:18:15,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:18:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843842160] [2022-04-28 13:18:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843842160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:18:15,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:18:15,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:18:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387426615] [2022-04-28 13:18:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:18:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 13:18:15,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:18:15,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:15,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:15,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:18:15,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:18:15,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:18:15,253 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:15,703 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-28 13:18:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 13:18:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 13:18:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:18:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 13:18:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 13:18:15,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-28 13:18:15,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:15,797 INFO L225 Difference]: With dead ends: 240 [2022-04-28 13:18:15,797 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 13:18:15,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:18:15,798 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:18:15,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:18:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 13:18:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-28 13:18:15,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:18:15,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:18:15,999 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:18:15,999 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:18:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:16,002 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 13:18:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 13:18:16,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:16,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:16,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 13:18:16,003 INFO L87 Difference]: Start difference. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 13:18:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:16,006 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 13:18:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 13:18:16,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:16,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:16,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:18:16,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:18:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:18:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-28 13:18:16,011 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-28 13:18:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:18:16,011 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-28 13:18:16,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:18:16,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-28 13:18:16,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-28 13:18:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 13:18:16,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:18:16,306 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:18:16,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 13:18:16,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:16,506 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:18:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:18:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-28 13:18:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:16,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556338586] [2022-04-28 13:18:20,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:18:20,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:18:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-28 13:18:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:18:20,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967014359] [2022-04-28 13:18:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:18:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:18:20,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:18:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499412173] [2022-04-28 13:18:20,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:18:20,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:20,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:18:20,621 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:18:20,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 13:18:20,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:18:20,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:18:20,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 13:18:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:18:20,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:18:21,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 13:18:21,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 13:18:21,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 13:18:21,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 13:18:21,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,388 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 < 100);havoc #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,389 INFO L272 TraceCheckUtils]: 8: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,389 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,389 INFO L272 TraceCheckUtils]: 13: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,390 INFO L272 TraceCheckUtils]: 18: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,391 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:18:21,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,392 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 < 100);havoc #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,392 INFO L272 TraceCheckUtils]: 26: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,393 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,393 INFO L272 TraceCheckUtils]: 31: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,394 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,394 INFO L272 TraceCheckUtils]: 36: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,395 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,396 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 < 100);havoc #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,396 INFO L272 TraceCheckUtils]: 44: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,397 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,397 INFO L272 TraceCheckUtils]: 49: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,398 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,398 INFO L272 TraceCheckUtils]: 54: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,398 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,400 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 < 100);havoc #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,400 INFO L272 TraceCheckUtils]: 62: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,400 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,400 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,401 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #86#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:18:21,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,403 INFO L290 TraceCheckUtils]: 74: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,403 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 < 100);havoc #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,403 INFO L272 TraceCheckUtils]: 76: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,403 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,404 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #84#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,404 INFO L272 TraceCheckUtils]: 81: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:21,404 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:21,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:21,404 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:21,405 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #86#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,406 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} is VALID [2022-04-28 13:18:21,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,407 INFO L290 TraceCheckUtils]: 88: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,408 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 < 100);havoc #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:18:21,408 INFO L272 TraceCheckUtils]: 90: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:18:21,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:18:21,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 13:18:21,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 13:18:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:21,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:18:56,065 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 13:18:56,066 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 13:18:56,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:18:56,067 INFO L272 TraceCheckUtils]: 90: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:18:56,067 INFO L290 TraceCheckUtils]: 89: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:18:56,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:18:56,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:18:56,098 INFO L290 TraceCheckUtils]: 86: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:18:56,099 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:18:56,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,099 INFO L272 TraceCheckUtils]: 81: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,100 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:18:56,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,100 INFO L272 TraceCheckUtils]: 76: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,101 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 < 100);havoc #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:18:56,102 INFO L290 TraceCheckUtils]: 74: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:18:56,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:18:56,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,341 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #86#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,342 INFO L272 TraceCheckUtils]: 67: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,343 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,343 INFO L272 TraceCheckUtils]: 62: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,347 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 < 100);havoc #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,356 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,356 INFO L272 TraceCheckUtils]: 54: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,357 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,358 INFO L272 TraceCheckUtils]: 49: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,358 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,359 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,359 INFO L272 TraceCheckUtils]: 44: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,363 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 < 100);havoc #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:18:56,519 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #82#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,519 INFO L272 TraceCheckUtils]: 36: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,520 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,520 INFO L272 TraceCheckUtils]: 31: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,521 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,521 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,522 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 < 100);havoc #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:18:56,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,555 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,555 INFO L272 TraceCheckUtils]: 13: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,556 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:18:56,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:18:56,556 INFO L272 TraceCheckUtils]: 8: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:18:56,557 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 < 100);havoc #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:18:56,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 13:18:56,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 13:18:56,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:18:56,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 13:18:56,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 13:18:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 24 refuted. 6 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:18:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:18:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967014359] [2022-04-28 13:18:56,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:18:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499412173] [2022-04-28 13:18:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499412173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:18:56,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:18:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 13:18:56,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:18:56,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556338586] [2022-04-28 13:18:56,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556338586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:18:56,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:18:56,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:18:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517111804] [2022-04-28 13:18:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:18:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 13:18:56,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:18:56,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:18:56,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:56,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:18:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:18:56,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2022-04-28 13:18:56,617 INFO L87 Difference]: Start difference. First operand 226 states and 263 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:18:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:58,173 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-28 13:18:58,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:18:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 13:18:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:18:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:18:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 13:18:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:18:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 13:18:58,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-28 13:18:58,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:58,296 INFO L225 Difference]: With dead ends: 275 [2022-04-28 13:18:58,297 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 13:18:58,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=64, Invalid=206, Unknown=2, NotChecked=0, Total=272 [2022-04-28 13:18:58,297 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 13:18:58,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 13:18:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 13:18:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-28 13:18:58,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:18:58,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:18:58,522 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:18:58,523 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:18:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:58,526 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 13:18:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 13:18:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:58,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:58,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 13:18:58,528 INFO L87 Difference]: Start difference. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 13:18:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:18:58,531 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 13:18:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 13:18:58,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:18:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:18:58,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:18:58,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:18:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:18:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-28 13:18:58,537 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-28 13:18:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:18:58,537 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-28 13:18:58,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:18:58,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-28 13:18:58,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:18:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-28 13:18:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 13:18:58,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:18:58,927 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:18:58,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 13:18:59,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:18:59,128 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:18:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:18:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-28 13:18:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:18:59,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552314134] [2022-04-28 13:19:01,224 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:19:01,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:19:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-28 13:19:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:19:01,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314121712] [2022-04-28 13:19:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:19:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:19:01,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:19:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129513861] [2022-04-28 13:19:01,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:19:01,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:19:01,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:19:01,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:19:01,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 13:19:01,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:19:01,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:19:01,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 13:19:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:19:01,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:10,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 100);havoc #t~post5; {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:10,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:10,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:10,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:10,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:10,837 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22623#true} #82#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:12,839 WARN L290 TraceCheckUtils]: 23: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-28 13:22:12,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:12,841 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 < 100);havoc #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:12,841 INFO L272 TraceCheckUtils]: 26: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:12,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:12,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:12,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:12,841 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #78#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:12,841 INFO L272 TraceCheckUtils]: 31: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #80#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:12,842 INFO L272 TraceCheckUtils]: 36: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:12,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:12,843 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #82#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,846 WARN L290 TraceCheckUtils]: 41: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-28 13:22:14,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,847 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 < 100);havoc #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,847 INFO L272 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:14,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #78#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,848 INFO L272 TraceCheckUtils]: 49: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:14,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:14,849 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #80#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,849 INFO L272 TraceCheckUtils]: 54: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:14,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:14,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:14,849 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:14,850 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #82#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,851 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 < 100);havoc #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,851 INFO L272 TraceCheckUtils]: 62: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:14,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:14,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:14,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:14,852 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #84#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:14,852 INFO L272 TraceCheckUtils]: 67: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:14,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:14,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:14,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:14,853 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #86#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:22:16,147 INFO L290 TraceCheckUtils]: 72: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,149 INFO L290 TraceCheckUtils]: 73: Hoare triple {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(#t~post6 < 100);havoc #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,151 INFO L272 TraceCheckUtils]: 76: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:16,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:16,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:16,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:16,152 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #84#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,152 INFO L272 TraceCheckUtils]: 81: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:16,152 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:16,153 INFO L290 TraceCheckUtils]: 83: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:16,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:16,153 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #86#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-28 13:22:16,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 13:22:16,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 13:22:16,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 13:22:16,331 INFO L290 TraceCheckUtils]: 89: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume !!(#t~post6 < 100);havoc #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 13:22:16,331 INFO L272 TraceCheckUtils]: 90: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:22:16,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:22:16,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:22:16,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:22:16,332 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #84#return; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-28 13:22:16,332 INFO L272 TraceCheckUtils]: 95: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:16,333 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:16,333 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 13:22:16,333 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 13:22:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 106 proven. 53 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-04-28 13:22:16,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:24:05,855 WARN L232 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 13:24:57,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 13:24:57,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 13:24:57,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:24:57,060 INFO L272 TraceCheckUtils]: 95: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:24:57,060 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #84#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:24:57,060 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,060 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,060 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,060 INFO L272 TraceCheckUtils]: 90: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post6 < 100);havoc #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:24:57,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:24:57,061 INFO L290 TraceCheckUtils]: 87: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:24:57,074 INFO L290 TraceCheckUtils]: 86: Hoare triple {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:24:57,086 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} is VALID [2022-04-28 13:24:57,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:24:57,086 INFO L290 TraceCheckUtils]: 83: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:24:57,087 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:24:57,087 INFO L272 TraceCheckUtils]: 81: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,087 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,087 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,088 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,088 INFO L272 TraceCheckUtils]: 76: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,090 INFO L290 TraceCheckUtils]: 74: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,432 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-28 13:24:57,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:24:57,433 INFO L290 TraceCheckUtils]: 69: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:24:57,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:24:57,433 INFO L272 TraceCheckUtils]: 67: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,434 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,434 INFO L272 TraceCheckUtils]: 62: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:24:57,438 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #82#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,438 INFO L272 TraceCheckUtils]: 54: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,439 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #80#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,439 INFO L272 TraceCheckUtils]: 49: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,440 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #78#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,440 INFO L272 TraceCheckUtils]: 44: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:24:57,470 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #82#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,470 INFO L272 TraceCheckUtils]: 36: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,470 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #80#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L272 TraceCheckUtils]: 31: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #78#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,472 INFO L272 TraceCheckUtils]: 26: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(#t~post5 < 100);havoc #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:24:57,476 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 100);havoc #t~post5; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 13:24:57,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 13:24:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 101 proven. 31 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-28 13:24:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:24:57,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314121712] [2022-04-28 13:24:57,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:24:57,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129513861] [2022-04-28 13:24:57,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129513861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:24:57,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:24:57,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-04-28 13:24:57,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:24:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552314134] [2022-04-28 13:24:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552314134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:24:57,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:24:57,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:24:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5099574] [2022-04-28 13:24:57,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:24:57,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 13:24:57,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:24:57,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:25:02,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 62 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:02,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:25:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:25:02,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=294, Unknown=2, NotChecked=0, Total=380 [2022-04-28 13:25:02,851 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:25:14,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:20,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:24,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:26,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:27,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:29,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:31,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:34,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:40,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:42,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:43,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:50,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:25:59,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:26:02,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:26:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:03,441 INFO L93 Difference]: Finished difference Result 270 states and 324 transitions. [2022-04-28 13:26:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:26:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 13:26:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:26:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:26:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2022-04-28 13:26:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:26:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2022-04-28 13:26:03,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2022-04-28 13:26:15,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 101 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:15,577 INFO L225 Difference]: With dead ends: 270 [2022-04-28 13:26:15,577 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 13:26:15,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=97, Invalid=363, Unknown=2, NotChecked=0, Total=462 [2022-04-28 13:26:15,578 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:26:15,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 6 Unknown, 132 Unchecked, 28.2s Time] [2022-04-28 13:26:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 13:26:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 258. [2022-04-28 13:26:15,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:26:15,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:26:15,939 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:26:15,939 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:26:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:15,943 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2022-04-28 13:26:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2022-04-28 13:26:15,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:15,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:15,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 268 states. [2022-04-28 13:26:15,945 INFO L87 Difference]: Start difference. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 268 states. [2022-04-28 13:26:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:15,948 INFO L93 Difference]: Finished difference Result 268 states and 322 transitions. [2022-04-28 13:26:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2022-04-28 13:26:15,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:15,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:15,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:26:15,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:26:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:26:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 304 transitions. [2022-04-28 13:26:15,954 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 304 transitions. Word has length 99 [2022-04-28 13:26:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:26:15,954 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 304 transitions. [2022-04-28 13:26:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:26:15,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 304 transitions. [2022-04-28 13:26:16,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 304 transitions. [2022-04-28 13:26:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 13:26:16,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:26:16,423 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:26:16,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 13:26:16,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:26:16,624 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:26:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:26:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-28 13:26:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:26:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952824955] [2022-04-28 13:26:18,744 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:26:18,744 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:26:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-28 13:26:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:26:18,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592351132] [2022-04-28 13:26:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:26:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:26:18,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:26:18,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019554765] [2022-04-28 13:26:18,756 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:26:18,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:26:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:26:18,757 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:26:18,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 13:26:18,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:26:18,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:26:18,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:26:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:26:18,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:26:19,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {24832#true} call ULTIMATE.init(); {24832#true} is VALID [2022-04-28 13:26:19,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {24832#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; {24832#true} is VALID [2022-04-28 13:26:19,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24832#true} {24832#true} #92#return; {24832#true} is VALID [2022-04-28 13:26:19,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {24832#true} call #t~ret7 := main(); {24832#true} is VALID [2022-04-28 13:26:19,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {24832#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; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {24852#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #78#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,070 INFO L272 TraceCheckUtils]: 13: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,071 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #80#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,071 INFO L272 TraceCheckUtils]: 18: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,071 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #82#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {24852#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {24852#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,072 INFO L272 TraceCheckUtils]: 26: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,073 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #78#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,073 INFO L272 TraceCheckUtils]: 31: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,073 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #80#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,073 INFO L272 TraceCheckUtils]: 36: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,074 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #82#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {24852#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {24852#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,075 INFO L272 TraceCheckUtils]: 44: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,075 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #78#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,075 INFO L272 TraceCheckUtils]: 49: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #80#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,076 INFO L272 TraceCheckUtils]: 54: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,077 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #82#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {24852#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {24852#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,077 INFO L272 TraceCheckUtils]: 62: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #84#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,078 INFO L272 TraceCheckUtils]: 67: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,079 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #86#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,079 INFO L290 TraceCheckUtils]: 72: Hoare triple {24852#(= 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); {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,079 INFO L290 TraceCheckUtils]: 73: Hoare triple {24852#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {24852#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,080 INFO L272 TraceCheckUtils]: 76: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,080 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #84#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,080 INFO L272 TraceCheckUtils]: 81: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:19,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:19,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:19,081 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24832#true} {24852#(= main_~B~0 1)} #86#return; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {24852#(= 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); {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {24852#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,082 INFO L290 TraceCheckUtils]: 88: Hoare triple {24852#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,082 INFO L290 TraceCheckUtils]: 89: Hoare triple {24852#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24852#(= main_~B~0 1)} is VALID [2022-04-28 13:26:19,082 INFO L272 TraceCheckUtils]: 90: Hoare triple {24852#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:19,082 INFO L290 TraceCheckUtils]: 91: Hoare triple {24832#true} ~cond := #in~cond; {25111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:26:19,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {25111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:19,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:19,083 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} {24852#(= main_~B~0 1)} #84#return; {25122#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-28 13:26:19,083 INFO L272 TraceCheckUtils]: 95: Hoare triple {25122#(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)); {24832#true} is VALID [2022-04-28 13:26:19,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {24832#true} ~cond := #in~cond; {25111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:26:19,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {25111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:19,084 INFO L290 TraceCheckUtils]: 98: Hoare triple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:19,085 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} {25122#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25138#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-28 13:26:19,085 INFO L290 TraceCheckUtils]: 100: Hoare triple {25138#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25142#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-28 13:26:19,086 INFO L272 TraceCheckUtils]: 101: Hoare triple {25142#(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)); {25146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:26:19,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {25146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:26:19,087 INFO L290 TraceCheckUtils]: 103: Hoare triple {25150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24833#false} is VALID [2022-04-28 13:26:19,087 INFO L290 TraceCheckUtils]: 104: Hoare triple {24833#false} assume !false; {24833#false} is VALID [2022-04-28 13:26:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 13:26:19,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:26:54,874 INFO L290 TraceCheckUtils]: 104: Hoare triple {24833#false} assume !false; {24833#false} is VALID [2022-04-28 13:26:54,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {25150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24833#false} is VALID [2022-04-28 13:26:54,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {25146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:26:54,875 INFO L272 TraceCheckUtils]: 101: Hoare triple {25166#(= (+ (* 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)); {25146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:26:54,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {25170#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {25166#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:26:54,877 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} {25174#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #86#return; {25170#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:26:54,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:54,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {25184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:54,878 INFO L290 TraceCheckUtils]: 96: Hoare triple {24832#true} ~cond := #in~cond; {25184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:26:54,879 INFO L272 TraceCheckUtils]: 95: Hoare triple {25174#(= (+ (* 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)); {24832#true} is VALID [2022-04-28 13:26:54,879 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} {24832#true} #84#return; {25174#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:26:54,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 92: Hoare triple {25184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 91: Hoare triple {24832#true} ~cond := #in~cond; {25184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:26:54,880 INFO L272 TraceCheckUtils]: 90: Hoare triple {24832#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {24832#true} assume !!(#t~post6 < 100);havoc #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {24832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 87: Hoare triple {24832#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24832#true} is VALID [2022-04-28 13:26:54,880 INFO L290 TraceCheckUtils]: 86: Hoare triple {24832#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); {24832#true} is VALID [2022-04-28 13:26:54,880 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24832#true} {24832#true} #86#return; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L272 TraceCheckUtils]: 81: Hoare triple {24832#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24832#true} {24832#true} #84#return; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L272 TraceCheckUtils]: 76: Hoare triple {24832#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {24832#true} assume !!(#t~post6 < 100);havoc #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {24832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {24832#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {24832#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); {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24832#true} {24832#true} #86#return; {24832#true} is VALID [2022-04-28 13:26:54,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L272 TraceCheckUtils]: 67: Hoare triple {24832#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24832#true} {24832#true} #84#return; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L272 TraceCheckUtils]: 62: Hoare triple {24832#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {24832#true} assume !!(#t~post6 < 100);havoc #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {24832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {24832#true} assume !(~r~0 >= ~d~0); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24832#true} {24832#true} #82#return; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L272 TraceCheckUtils]: 54: Hoare triple {24832#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24832#true} {24832#true} #80#return; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L272 TraceCheckUtils]: 49: Hoare triple {24832#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24832#true} {24832#true} #78#return; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L272 TraceCheckUtils]: 44: Hoare triple {24832#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {24832#true} assume !!(#t~post5 < 100);havoc #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {24832#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {24832#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24832#true} {24832#true} #82#return; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L272 TraceCheckUtils]: 36: Hoare triple {24832#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24832#true} {24832#true} #80#return; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L272 TraceCheckUtils]: 31: Hoare triple {24832#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24832#true} {24832#true} #78#return; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,884 INFO L272 TraceCheckUtils]: 26: Hoare triple {24832#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {24832#true} assume !!(#t~post5 < 100);havoc #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {24832#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {24832#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24832#true} {24832#true} #82#return; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L272 TraceCheckUtils]: 18: Hoare triple {24832#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24832#true} {24832#true} #80#return; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L272 TraceCheckUtils]: 13: Hoare triple {24832#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24832#true} {24832#true} #78#return; {24832#true} is VALID [2022-04-28 13:26:54,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {24832#true} assume !(0 == ~cond); {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {24832#true} ~cond := #in~cond; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L272 TraceCheckUtils]: 8: Hoare triple {24832#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {24832#true} assume !!(#t~post5 < 100);havoc #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {24832#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {24832#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; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {24832#true} call #t~ret7 := main(); {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24832#true} {24832#true} #92#return; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {24832#true} assume true; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {24832#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; {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {24832#true} call ULTIMATE.init(); {24832#true} is VALID [2022-04-28 13:26:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 13:26:54,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:26:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592351132] [2022-04-28 13:26:54,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:26:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019554765] [2022-04-28 13:26:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019554765] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:26:54,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:26:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 13:26:54,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:26:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952824955] [2022-04-28 13:26:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952824955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:26:54,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:26:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:26:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200500576] [2022-04-28 13:26:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:26:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 13:26:54,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:26:54,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:26:54,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:26:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:26:54,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:26:54,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:26:54,921 INFO L87 Difference]: Start difference. First operand 258 states and 304 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:26:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:55,861 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2022-04-28 13:26:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:26:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 13:26:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:26:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:26:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 13:26:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:26:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 13:26:55,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 13:26:55,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:55,916 INFO L225 Difference]: With dead ends: 275 [2022-04-28 13:26:55,916 INFO L226 Difference]: Without dead ends: 270 [2022-04-28 13:26:55,916 INFO L412 NwaCegarLoop]: 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-28 13:26:55,916 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:26:55,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 109 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:26:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-28 13:26:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-04-28 13:26:56,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:26:56,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 13:26:56,285 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 13:26:56,285 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 13:26:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:56,289 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-04-28 13:26:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2022-04-28 13:26:56,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:56,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:56,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 270 states. [2022-04-28 13:26:56,290 INFO L87 Difference]: Start difference. First operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 270 states. [2022-04-28 13:26:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:56,294 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-04-28 13:26:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2022-04-28 13:26:56,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:56,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:56,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:26:56,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:26:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 49 states have call successors, (49), 35 states have call predecessors, (49), 34 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-28 13:26:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 285 transitions. [2022-04-28 13:26:56,299 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 285 transitions. Word has length 105 [2022-04-28 13:26:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:26:56,299 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 285 transitions. [2022-04-28 13:26:56,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:26:56,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 285 transitions. [2022-04-28 13:26:56,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 285 transitions. [2022-04-28 13:26:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 13:26:56,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:26:56,760 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:26:56,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 13:26:56,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 13:26:56,960 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:26:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:26:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 7 times [2022-04-28 13:26:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:26:56,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809239967] [2022-04-28 13:27:01,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:01,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 8 times [2022-04-28 13:27:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206184541] [2022-04-28 13:27:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:01,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:01,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:01,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874599] [2022-04-28 13:27:01,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:27:01,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:01,055 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:01,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 13:27:01,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:27:01,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:01,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:27:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:01,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:01,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {27079#true} call ULTIMATE.init(); {27079#true} is VALID [2022-04-28 13:27:01,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {27079#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; {27087#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:01,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {27087#(<= ~counter~0 0)} assume true; {27087#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:01,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27087#(<= ~counter~0 0)} {27079#true} #92#return; {27087#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:01,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {27087#(<= ~counter~0 0)} call #t~ret7 := main(); {27087#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:01,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {27087#(<= ~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; {27087#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:01,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {27087#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {27103#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,596 INFO L272 TraceCheckUtils]: 8: Hoare triple {27103#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {27103#(<= ~counter~0 1)} ~cond := #in~cond; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {27103#(<= ~counter~0 1)} assume !(0 == ~cond); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {27103#(<= ~counter~0 1)} assume true; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,598 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27103#(<= ~counter~0 1)} {27103#(<= ~counter~0 1)} #78#return; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,598 INFO L272 TraceCheckUtils]: 13: Hoare triple {27103#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {27103#(<= ~counter~0 1)} ~cond := #in~cond; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {27103#(<= ~counter~0 1)} assume !(0 == ~cond); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {27103#(<= ~counter~0 1)} assume true; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27103#(<= ~counter~0 1)} {27103#(<= ~counter~0 1)} #80#return; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {27103#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {27103#(<= ~counter~0 1)} ~cond := #in~cond; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {27103#(<= ~counter~0 1)} assume !(0 == ~cond); {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {27103#(<= ~counter~0 1)} assume true; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,601 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27103#(<= ~counter~0 1)} {27103#(<= ~counter~0 1)} #82#return; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {27103#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27103#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:01,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {27103#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {27158#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,602 INFO L272 TraceCheckUtils]: 26: Hoare triple {27158#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {27158#(<= ~counter~0 2)} ~cond := #in~cond; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {27158#(<= ~counter~0 2)} assume !(0 == ~cond); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {27158#(<= ~counter~0 2)} assume true; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,604 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27158#(<= ~counter~0 2)} {27158#(<= ~counter~0 2)} #78#return; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,604 INFO L272 TraceCheckUtils]: 31: Hoare triple {27158#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {27158#(<= ~counter~0 2)} ~cond := #in~cond; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {27158#(<= ~counter~0 2)} assume !(0 == ~cond); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {27158#(<= ~counter~0 2)} assume true; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,605 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27158#(<= ~counter~0 2)} {27158#(<= ~counter~0 2)} #80#return; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,606 INFO L272 TraceCheckUtils]: 36: Hoare triple {27158#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {27158#(<= ~counter~0 2)} ~cond := #in~cond; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {27158#(<= ~counter~0 2)} assume !(0 == ~cond); {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {27158#(<= ~counter~0 2)} assume true; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,607 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27158#(<= ~counter~0 2)} {27158#(<= ~counter~0 2)} #82#return; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {27158#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27158#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:01,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {27158#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {27213#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,608 INFO L272 TraceCheckUtils]: 44: Hoare triple {27213#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {27213#(<= ~counter~0 3)} ~cond := #in~cond; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {27213#(<= ~counter~0 3)} assume !(0 == ~cond); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {27213#(<= ~counter~0 3)} assume true; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,610 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27213#(<= ~counter~0 3)} {27213#(<= ~counter~0 3)} #78#return; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,610 INFO L272 TraceCheckUtils]: 49: Hoare triple {27213#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {27213#(<= ~counter~0 3)} ~cond := #in~cond; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {27213#(<= ~counter~0 3)} assume !(0 == ~cond); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {27213#(<= ~counter~0 3)} assume true; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,611 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27213#(<= ~counter~0 3)} {27213#(<= ~counter~0 3)} #80#return; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,612 INFO L272 TraceCheckUtils]: 54: Hoare triple {27213#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {27213#(<= ~counter~0 3)} ~cond := #in~cond; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {27213#(<= ~counter~0 3)} assume !(0 == ~cond); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {27213#(<= ~counter~0 3)} assume true; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,613 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27213#(<= ~counter~0 3)} {27213#(<= ~counter~0 3)} #82#return; {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {27213#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {27213#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:01,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {27213#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {27268#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,614 INFO L272 TraceCheckUtils]: 62: Hoare triple {27268#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {27268#(<= ~counter~0 4)} ~cond := #in~cond; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {27268#(<= ~counter~0 4)} assume !(0 == ~cond); {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {27268#(<= ~counter~0 4)} assume true; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,616 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27268#(<= ~counter~0 4)} {27268#(<= ~counter~0 4)} #84#return; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,616 INFO L272 TraceCheckUtils]: 67: Hoare triple {27268#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {27268#(<= ~counter~0 4)} ~cond := #in~cond; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {27268#(<= ~counter~0 4)} assume !(0 == ~cond); {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {27268#(<= ~counter~0 4)} assume true; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,617 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27268#(<= ~counter~0 4)} {27268#(<= ~counter~0 4)} #86#return; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {27268#(<= ~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); {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,618 INFO L290 TraceCheckUtils]: 73: Hoare triple {27268#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27268#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:01,618 INFO L290 TraceCheckUtils]: 74: Hoare triple {27268#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {27311#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,619 INFO L272 TraceCheckUtils]: 76: Hoare triple {27311#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,620 INFO L290 TraceCheckUtils]: 77: Hoare triple {27311#(<= ~counter~0 5)} ~cond := #in~cond; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,620 INFO L290 TraceCheckUtils]: 78: Hoare triple {27311#(<= ~counter~0 5)} assume !(0 == ~cond); {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,620 INFO L290 TraceCheckUtils]: 79: Hoare triple {27311#(<= ~counter~0 5)} assume true; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,621 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27311#(<= ~counter~0 5)} {27311#(<= ~counter~0 5)} #84#return; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,621 INFO L272 TraceCheckUtils]: 81: Hoare triple {27311#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {27311#(<= ~counter~0 5)} ~cond := #in~cond; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,621 INFO L290 TraceCheckUtils]: 83: Hoare triple {27311#(<= ~counter~0 5)} assume !(0 == ~cond); {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,622 INFO L290 TraceCheckUtils]: 84: Hoare triple {27311#(<= ~counter~0 5)} assume true; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,622 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27311#(<= ~counter~0 5)} {27311#(<= ~counter~0 5)} #86#return; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {27311#(<= ~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); {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {27311#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27311#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:01,623 INFO L290 TraceCheckUtils]: 88: Hoare triple {27311#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {27354#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,624 INFO L272 TraceCheckUtils]: 90: Hoare triple {27354#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {27354#(<= ~counter~0 6)} ~cond := #in~cond; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,625 INFO L290 TraceCheckUtils]: 92: Hoare triple {27354#(<= ~counter~0 6)} assume !(0 == ~cond); {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {27354#(<= ~counter~0 6)} assume true; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,625 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27354#(<= ~counter~0 6)} {27354#(<= ~counter~0 6)} #84#return; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,626 INFO L272 TraceCheckUtils]: 95: Hoare triple {27354#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,626 INFO L290 TraceCheckUtils]: 96: Hoare triple {27354#(<= ~counter~0 6)} ~cond := #in~cond; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,626 INFO L290 TraceCheckUtils]: 97: Hoare triple {27354#(<= ~counter~0 6)} assume !(0 == ~cond); {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,627 INFO L290 TraceCheckUtils]: 98: Hoare triple {27354#(<= ~counter~0 6)} assume true; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,627 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27354#(<= ~counter~0 6)} {27354#(<= ~counter~0 6)} #86#return; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,627 INFO L290 TraceCheckUtils]: 100: Hoare triple {27354#(<= ~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); {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,628 INFO L290 TraceCheckUtils]: 101: Hoare triple {27354#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27354#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:01,628 INFO L290 TraceCheckUtils]: 102: Hoare triple {27354#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27397#(<= |main_#t~post6| 6)} is VALID [2022-04-28 13:27:01,628 INFO L290 TraceCheckUtils]: 103: Hoare triple {27397#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {27080#false} is VALID [2022-04-28 13:27:01,628 INFO L272 TraceCheckUtils]: 104: Hoare triple {27080#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27080#false} is VALID [2022-04-28 13:27:01,628 INFO L290 TraceCheckUtils]: 105: Hoare triple {27080#false} ~cond := #in~cond; {27080#false} is VALID [2022-04-28 13:27:01,629 INFO L290 TraceCheckUtils]: 106: Hoare triple {27080#false} assume 0 == ~cond; {27080#false} is VALID [2022-04-28 13:27:01,629 INFO L290 TraceCheckUtils]: 107: Hoare triple {27080#false} assume !false; {27080#false} is VALID [2022-04-28 13:27:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 414 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 13:27:01,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:02,094 INFO L290 TraceCheckUtils]: 107: Hoare triple {27080#false} assume !false; {27080#false} is VALID [2022-04-28 13:27:02,094 INFO L290 TraceCheckUtils]: 106: Hoare triple {27080#false} assume 0 == ~cond; {27080#false} is VALID [2022-04-28 13:27:02,094 INFO L290 TraceCheckUtils]: 105: Hoare triple {27080#false} ~cond := #in~cond; {27080#false} is VALID [2022-04-28 13:27:02,094 INFO L272 TraceCheckUtils]: 104: Hoare triple {27080#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27080#false} is VALID [2022-04-28 13:27:02,094 INFO L290 TraceCheckUtils]: 103: Hoare triple {27425#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {27080#false} is VALID [2022-04-28 13:27:02,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {27429#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27425#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:27:02,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {27429#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,095 INFO L290 TraceCheckUtils]: 100: Hoare triple {27429#(< ~counter~0 100)} 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); {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,096 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27079#true} {27429#(< ~counter~0 100)} #86#return; {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,096 INFO L290 TraceCheckUtils]: 98: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,096 INFO L272 TraceCheckUtils]: 95: Hoare triple {27429#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,097 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27079#true} {27429#(< ~counter~0 100)} #84#return; {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,097 INFO L290 TraceCheckUtils]: 91: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,097 INFO L272 TraceCheckUtils]: 90: Hoare triple {27429#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,097 INFO L290 TraceCheckUtils]: 89: Hoare triple {27429#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {27472#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27429#(< ~counter~0 100)} is VALID [2022-04-28 13:27:02,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {27472#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {27472#(< ~counter~0 99)} 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); {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,099 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27079#true} {27472#(< ~counter~0 99)} #86#return; {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,099 INFO L272 TraceCheckUtils]: 81: Hoare triple {27472#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,100 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27079#true} {27472#(< ~counter~0 99)} #84#return; {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,100 INFO L272 TraceCheckUtils]: 76: Hoare triple {27472#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {27472#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {27515#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27472#(< ~counter~0 99)} is VALID [2022-04-28 13:27:02,101 INFO L290 TraceCheckUtils]: 73: Hoare triple {27515#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {27515#(< ~counter~0 98)} 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); {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,102 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27079#true} {27515#(< ~counter~0 98)} #86#return; {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,102 INFO L272 TraceCheckUtils]: 67: Hoare triple {27515#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,103 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27079#true} {27515#(< ~counter~0 98)} #84#return; {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,103 INFO L272 TraceCheckUtils]: 62: Hoare triple {27515#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {27515#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {27558#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27515#(< ~counter~0 98)} is VALID [2022-04-28 13:27:02,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {27558#(< ~counter~0 97)} assume !(~r~0 >= ~d~0); {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,104 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27079#true} {27558#(< ~counter~0 97)} #82#return; {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L272 TraceCheckUtils]: 54: Hoare triple {27558#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27079#true} {27558#(< ~counter~0 97)} #80#return; {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,105 INFO L272 TraceCheckUtils]: 49: Hoare triple {27558#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,106 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27079#true} {27558#(< ~counter~0 97)} #78#return; {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,106 INFO L272 TraceCheckUtils]: 44: Hoare triple {27558#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {27558#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {27613#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27558#(< ~counter~0 97)} is VALID [2022-04-28 13:27:02,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {27613#(< ~counter~0 96)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,108 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27079#true} {27613#(< ~counter~0 96)} #82#return; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,108 INFO L272 TraceCheckUtils]: 36: Hoare triple {27613#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,108 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27079#true} {27613#(< ~counter~0 96)} #80#return; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L272 TraceCheckUtils]: 31: Hoare triple {27613#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27079#true} {27613#(< ~counter~0 96)} #78#return; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,109 INFO L272 TraceCheckUtils]: 26: Hoare triple {27613#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {27613#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {27668#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27613#(< ~counter~0 96)} is VALID [2022-04-28 13:27:02,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {27668#(< ~counter~0 95)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,111 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27079#true} {27668#(< ~counter~0 95)} #82#return; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,111 INFO L272 TraceCheckUtils]: 18: Hoare triple {27668#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,111 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27079#true} {27668#(< ~counter~0 95)} #80#return; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L272 TraceCheckUtils]: 13: Hoare triple {27668#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27079#true} {27668#(< ~counter~0 95)} #78#return; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {27079#true} assume true; {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {27079#true} assume !(0 == ~cond); {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {27079#true} ~cond := #in~cond; {27079#true} is VALID [2022-04-28 13:27:02,112 INFO L272 TraceCheckUtils]: 8: Hoare triple {27668#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27079#true} is VALID [2022-04-28 13:27:02,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {27668#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {27723#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27668#(< ~counter~0 95)} is VALID [2022-04-28 13:27:02,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {27723#(< ~counter~0 94)} 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; {27723#(< ~counter~0 94)} is VALID [2022-04-28 13:27:02,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {27723#(< ~counter~0 94)} call #t~ret7 := main(); {27723#(< ~counter~0 94)} is VALID [2022-04-28 13:27:02,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27723#(< ~counter~0 94)} {27079#true} #92#return; {27723#(< ~counter~0 94)} is VALID [2022-04-28 13:27:02,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {27723#(< ~counter~0 94)} assume true; {27723#(< ~counter~0 94)} is VALID [2022-04-28 13:27:02,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {27079#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; {27723#(< ~counter~0 94)} is VALID [2022-04-28 13:27:02,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {27079#true} call ULTIMATE.init(); {27079#true} is VALID [2022-04-28 13:27:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 13:27:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:02,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206184541] [2022-04-28 13:27:02,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874599] [2022-04-28 13:27:02,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:02,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:02,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 13:27:02,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809239967] [2022-04-28 13:27:02,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809239967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:02,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:02,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:27:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893391157] [2022-04-28 13:27:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 13:27:02,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:02,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:27:02,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:27:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:27:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:27:02,176 INFO L87 Difference]: Start difference. First operand 253 states and 285 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:27:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:03,058 INFO L93 Difference]: Finished difference Result 329 states and 371 transitions. [2022-04-28 13:27:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:27:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 13:27:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:27:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 13:27:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:27:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 13:27:03,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2022-04-28 13:27:03,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:03,171 INFO L225 Difference]: With dead ends: 329 [2022-04-28 13:27:03,171 INFO L226 Difference]: Without dead ends: 316 [2022-04-28 13:27:03,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=253, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:27:03,172 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 41 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:03,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:27:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-28 13:27:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2022-04-28 13:27:03,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:03,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:03,606 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:03,606 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:03,611 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2022-04-28 13:27:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2022-04-28 13:27:03,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:03,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:03,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 316 states. [2022-04-28 13:27:03,612 INFO L87 Difference]: Start difference. First operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 316 states. [2022-04-28 13:27:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:03,616 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2022-04-28 13:27:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2022-04-28 13:27:03,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:03,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:03,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:03,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 221 states have internal predecessors, (240), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 350 transitions. [2022-04-28 13:27:03,622 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 350 transitions. Word has length 108 [2022-04-28 13:27:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:03,622 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 350 transitions. [2022-04-28 13:27:03,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:27:03,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 350 transitions. [2022-04-28 13:27:04,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 350 transitions. [2022-04-28 13:27:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 13:27:04,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:04,184 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:04,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 13:27:04,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 13:27:04,385 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 1 times [2022-04-28 13:27:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315575387] [2022-04-28 13:27:08,474 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:08,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 2 times [2022-04-28 13:27:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:08,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976473557] [2022-04-28 13:27:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:08,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:08,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905540524] [2022-04-28 13:27:08,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:27:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:08,486 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:08,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 13:27:08,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:27:08,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:08,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:27:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:08,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:09,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {29670#true} call ULTIMATE.init(); {29670#true} is VALID [2022-04-28 13:27:09,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {29670#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; {29678#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:09,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {29678#(<= ~counter~0 0)} assume true; {29678#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:09,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29678#(<= ~counter~0 0)} {29670#true} #92#return; {29678#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:09,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {29678#(<= ~counter~0 0)} call #t~ret7 := main(); {29678#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:09,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {29678#(<= ~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; {29678#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:09,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {29678#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {29694#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,005 INFO L272 TraceCheckUtils]: 8: Hoare triple {29694#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {29694#(<= ~counter~0 1)} ~cond := #in~cond; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {29694#(<= ~counter~0 1)} assume !(0 == ~cond); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {29694#(<= ~counter~0 1)} assume true; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,007 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29694#(<= ~counter~0 1)} {29694#(<= ~counter~0 1)} #78#return; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,007 INFO L272 TraceCheckUtils]: 13: Hoare triple {29694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {29694#(<= ~counter~0 1)} ~cond := #in~cond; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {29694#(<= ~counter~0 1)} assume !(0 == ~cond); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {29694#(<= ~counter~0 1)} assume true; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,008 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29694#(<= ~counter~0 1)} {29694#(<= ~counter~0 1)} #80#return; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {29694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {29694#(<= ~counter~0 1)} ~cond := #in~cond; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {29694#(<= ~counter~0 1)} assume !(0 == ~cond); {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {29694#(<= ~counter~0 1)} assume true; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,010 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29694#(<= ~counter~0 1)} {29694#(<= ~counter~0 1)} #82#return; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {29694#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29694#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:09,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {29694#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {29749#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,011 INFO L272 TraceCheckUtils]: 26: Hoare triple {29749#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {29749#(<= ~counter~0 2)} ~cond := #in~cond; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {29749#(<= ~counter~0 2)} assume !(0 == ~cond); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {29749#(<= ~counter~0 2)} assume true; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,012 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29749#(<= ~counter~0 2)} {29749#(<= ~counter~0 2)} #78#return; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,013 INFO L272 TraceCheckUtils]: 31: Hoare triple {29749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {29749#(<= ~counter~0 2)} ~cond := #in~cond; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {29749#(<= ~counter~0 2)} assume !(0 == ~cond); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {29749#(<= ~counter~0 2)} assume true; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,014 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29749#(<= ~counter~0 2)} {29749#(<= ~counter~0 2)} #80#return; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,026 INFO L272 TraceCheckUtils]: 36: Hoare triple {29749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {29749#(<= ~counter~0 2)} ~cond := #in~cond; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {29749#(<= ~counter~0 2)} assume !(0 == ~cond); {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {29749#(<= ~counter~0 2)} assume true; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,027 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29749#(<= ~counter~0 2)} {29749#(<= ~counter~0 2)} #82#return; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {29749#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29749#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:09,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {29749#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {29804#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,029 INFO L272 TraceCheckUtils]: 44: Hoare triple {29804#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {29804#(<= ~counter~0 3)} ~cond := #in~cond; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {29804#(<= ~counter~0 3)} assume !(0 == ~cond); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {29804#(<= ~counter~0 3)} assume true; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,030 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29804#(<= ~counter~0 3)} {29804#(<= ~counter~0 3)} #78#return; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,030 INFO L272 TraceCheckUtils]: 49: Hoare triple {29804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {29804#(<= ~counter~0 3)} ~cond := #in~cond; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {29804#(<= ~counter~0 3)} assume !(0 == ~cond); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {29804#(<= ~counter~0 3)} assume true; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,031 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29804#(<= ~counter~0 3)} {29804#(<= ~counter~0 3)} #80#return; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,032 INFO L272 TraceCheckUtils]: 54: Hoare triple {29804#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {29804#(<= ~counter~0 3)} ~cond := #in~cond; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {29804#(<= ~counter~0 3)} assume !(0 == ~cond); {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {29804#(<= ~counter~0 3)} assume true; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,033 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29804#(<= ~counter~0 3)} {29804#(<= ~counter~0 3)} #82#return; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {29804#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29804#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:09,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {29804#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {29859#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,034 INFO L272 TraceCheckUtils]: 62: Hoare triple {29859#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,035 INFO L290 TraceCheckUtils]: 63: Hoare triple {29859#(<= ~counter~0 4)} ~cond := #in~cond; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {29859#(<= ~counter~0 4)} assume !(0 == ~cond); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {29859#(<= ~counter~0 4)} assume true; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,036 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29859#(<= ~counter~0 4)} {29859#(<= ~counter~0 4)} #78#return; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,036 INFO L272 TraceCheckUtils]: 67: Hoare triple {29859#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {29859#(<= ~counter~0 4)} ~cond := #in~cond; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {29859#(<= ~counter~0 4)} assume !(0 == ~cond); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {29859#(<= ~counter~0 4)} assume true; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,037 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29859#(<= ~counter~0 4)} {29859#(<= ~counter~0 4)} #80#return; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,038 INFO L272 TraceCheckUtils]: 72: Hoare triple {29859#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {29859#(<= ~counter~0 4)} ~cond := #in~cond; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {29859#(<= ~counter~0 4)} assume !(0 == ~cond); {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {29859#(<= ~counter~0 4)} assume true; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,039 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29859#(<= ~counter~0 4)} {29859#(<= ~counter~0 4)} #82#return; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {29859#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29859#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:09,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {29859#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {29914#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,040 INFO L272 TraceCheckUtils]: 80: Hoare triple {29914#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {29914#(<= ~counter~0 5)} ~cond := #in~cond; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {29914#(<= ~counter~0 5)} assume !(0 == ~cond); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {29914#(<= ~counter~0 5)} assume true; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,041 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29914#(<= ~counter~0 5)} {29914#(<= ~counter~0 5)} #78#return; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,042 INFO L272 TraceCheckUtils]: 85: Hoare triple {29914#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,042 INFO L290 TraceCheckUtils]: 86: Hoare triple {29914#(<= ~counter~0 5)} ~cond := #in~cond; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,042 INFO L290 TraceCheckUtils]: 87: Hoare triple {29914#(<= ~counter~0 5)} assume !(0 == ~cond); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {29914#(<= ~counter~0 5)} assume true; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,043 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29914#(<= ~counter~0 5)} {29914#(<= ~counter~0 5)} #80#return; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,043 INFO L272 TraceCheckUtils]: 90: Hoare triple {29914#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,044 INFO L290 TraceCheckUtils]: 91: Hoare triple {29914#(<= ~counter~0 5)} ~cond := #in~cond; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,044 INFO L290 TraceCheckUtils]: 92: Hoare triple {29914#(<= ~counter~0 5)} assume !(0 == ~cond); {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,044 INFO L290 TraceCheckUtils]: 93: Hoare triple {29914#(<= ~counter~0 5)} assume true; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,045 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29914#(<= ~counter~0 5)} {29914#(<= ~counter~0 5)} #82#return; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {29914#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29914#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:09,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {29914#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29969#(<= |main_#t~post5| 5)} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {29969#(<= |main_#t~post5| 5)} assume !(#t~post5 < 100);havoc #t~post5; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {29671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {29671#false} assume !!(#t~post6 < 100);havoc #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L272 TraceCheckUtils]: 100: Hoare triple {29671#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {29671#false} ~cond := #in~cond; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {29671#false} assume !(0 == ~cond); {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {29671#false} assume true; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29671#false} {29671#false} #84#return; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L272 TraceCheckUtils]: 105: Hoare triple {29671#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {29671#false} ~cond := #in~cond; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {29671#false} assume !(0 == ~cond); {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L290 TraceCheckUtils]: 108: Hoare triple {29671#false} assume true; {29671#false} is VALID [2022-04-28 13:27:09,046 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29671#false} {29671#false} #86#return; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {29671#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); {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {29671#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 112: Hoare triple {29671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 113: Hoare triple {29671#false} assume !(#t~post6 < 100);havoc #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L272 TraceCheckUtils]: 114: Hoare triple {29671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 115: Hoare triple {29671#false} ~cond := #in~cond; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {29671#false} assume 0 == ~cond; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {29671#false} assume !false; {29671#false} is VALID [2022-04-28 13:27:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 150 proven. 430 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 13:27:09,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:09,509 INFO L290 TraceCheckUtils]: 117: Hoare triple {29671#false} assume !false; {29671#false} is VALID [2022-04-28 13:27:09,509 INFO L290 TraceCheckUtils]: 116: Hoare triple {29671#false} assume 0 == ~cond; {29671#false} is VALID [2022-04-28 13:27:09,509 INFO L290 TraceCheckUtils]: 115: Hoare triple {29671#false} ~cond := #in~cond; {29671#false} is VALID [2022-04-28 13:27:09,509 INFO L272 TraceCheckUtils]: 114: Hoare triple {29671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29671#false} is VALID [2022-04-28 13:27:09,509 INFO L290 TraceCheckUtils]: 113: Hoare triple {29671#false} assume !(#t~post6 < 100);havoc #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {29671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 111: Hoare triple {29671#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {29671#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); {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29670#true} {29671#false} #86#return; {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 108: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 107: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 106: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L272 TraceCheckUtils]: 105: Hoare triple {29671#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29670#true} {29671#false} #84#return; {29671#false} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 103: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 102: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 101: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L272 TraceCheckUtils]: 100: Hoare triple {29671#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {29671#false} assume !!(#t~post6 < 100);havoc #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {29671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29671#false} is VALID [2022-04-28 13:27:09,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {30093#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {29671#false} is VALID [2022-04-28 13:27:09,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {30097#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30093#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:27:09,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {30097#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,512 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29670#true} {30097#(< ~counter~0 100)} #82#return; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,512 INFO L272 TraceCheckUtils]: 90: Hoare triple {30097#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29670#true} {30097#(< ~counter~0 100)} #80#return; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L290 TraceCheckUtils]: 87: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L272 TraceCheckUtils]: 85: Hoare triple {30097#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29670#true} {30097#(< ~counter~0 100)} #78#return; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,513 INFO L290 TraceCheckUtils]: 83: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,513 INFO L290 TraceCheckUtils]: 82: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,514 INFO L290 TraceCheckUtils]: 81: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,514 INFO L272 TraceCheckUtils]: 80: Hoare triple {30097#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {30097#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {30152#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30097#(< ~counter~0 100)} is VALID [2022-04-28 13:27:09,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {30152#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,516 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29670#true} {30152#(< ~counter~0 99)} #82#return; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,516 INFO L272 TraceCheckUtils]: 72: Hoare triple {30152#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,516 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29670#true} {30152#(< ~counter~0 99)} #80#return; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L272 TraceCheckUtils]: 67: Hoare triple {30152#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29670#true} {30152#(< ~counter~0 99)} #78#return; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L272 TraceCheckUtils]: 62: Hoare triple {30152#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {30152#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {30207#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30152#(< ~counter~0 99)} is VALID [2022-04-28 13:27:09,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {30207#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,519 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29670#true} {30207#(< ~counter~0 98)} #82#return; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,519 INFO L272 TraceCheckUtils]: 54: Hoare triple {30207#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29670#true} {30207#(< ~counter~0 98)} #80#return; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L272 TraceCheckUtils]: 49: Hoare triple {30207#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29670#true} {30207#(< ~counter~0 98)} #78#return; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,520 INFO L272 TraceCheckUtils]: 44: Hoare triple {30207#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {30207#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {30262#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30207#(< ~counter~0 98)} is VALID [2022-04-28 13:27:09,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {30262#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,522 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29670#true} {30262#(< ~counter~0 97)} #82#return; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L272 TraceCheckUtils]: 36: Hoare triple {30262#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29670#true} {30262#(< ~counter~0 97)} #80#return; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L272 TraceCheckUtils]: 31: Hoare triple {30262#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29670#true} {30262#(< ~counter~0 97)} #78#return; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L272 TraceCheckUtils]: 26: Hoare triple {30262#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {30262#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {30317#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30262#(< ~counter~0 97)} is VALID [2022-04-28 13:27:09,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {30317#(< ~counter~0 96)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,524 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29670#true} {30317#(< ~counter~0 96)} #82#return; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L272 TraceCheckUtils]: 18: Hoare triple {30317#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29670#true} {30317#(< ~counter~0 96)} #80#return; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {30317#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,525 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29670#true} {30317#(< ~counter~0 96)} #78#return; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {29670#true} assume true; {29670#true} is VALID [2022-04-28 13:27:09,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {29670#true} assume !(0 == ~cond); {29670#true} is VALID [2022-04-28 13:27:09,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {29670#true} ~cond := #in~cond; {29670#true} is VALID [2022-04-28 13:27:09,526 INFO L272 TraceCheckUtils]: 8: Hoare triple {30317#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29670#true} is VALID [2022-04-28 13:27:09,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {30317#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {30372#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30317#(< ~counter~0 96)} is VALID [2022-04-28 13:27:09,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {30372#(< ~counter~0 95)} 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; {30372#(< ~counter~0 95)} is VALID [2022-04-28 13:27:09,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {30372#(< ~counter~0 95)} call #t~ret7 := main(); {30372#(< ~counter~0 95)} is VALID [2022-04-28 13:27:09,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30372#(< ~counter~0 95)} {29670#true} #92#return; {30372#(< ~counter~0 95)} is VALID [2022-04-28 13:27:09,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {30372#(< ~counter~0 95)} assume true; {30372#(< ~counter~0 95)} is VALID [2022-04-28 13:27:09,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {29670#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; {30372#(< ~counter~0 95)} is VALID [2022-04-28 13:27:09,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {29670#true} call ULTIMATE.init(); {29670#true} is VALID [2022-04-28 13:27:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-04-28 13:27:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976473557] [2022-04-28 13:27:09,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905540524] [2022-04-28 13:27:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905540524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:09,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 13:27:09,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315575387] [2022-04-28 13:27:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315575387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:09,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:27:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271675033] [2022-04-28 13:27:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 13:27:09,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:27:09,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:09,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:27:09,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:27:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:27:09,590 INFO L87 Difference]: Start difference. First operand 315 states and 350 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:27:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:10,115 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2022-04-28 13:27:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 13:27:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 13:27:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:27:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 13:27:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:27:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 13:27:10,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-04-28 13:27:10,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:10,224 INFO L225 Difference]: With dead ends: 368 [2022-04-28 13:27:10,224 INFO L226 Difference]: Without dead ends: 313 [2022-04-28 13:27:10,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:27:10,224 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:10,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 188 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:27:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-28 13:27:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-04-28 13:27:10,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:10,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:10,609 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:10,610 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:10,621 INFO L93 Difference]: Finished difference Result 313 states and 347 transitions. [2022-04-28 13:27:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 13:27:10,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:10,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:10,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 313 states. [2022-04-28 13:27:10,626 INFO L87 Difference]: Start difference. First operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 313 states. [2022-04-28 13:27:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:10,630 INFO L93 Difference]: Finished difference Result 313 states and 347 transitions. [2022-04-28 13:27:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 13:27:10,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:10,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:10,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:10,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 219 states have internal predecessors, (237), 56 states have call successors, (56), 43 states have call predecessors, (56), 42 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 13:27:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 347 transitions. [2022-04-28 13:27:10,636 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 347 transitions. Word has length 118 [2022-04-28 13:27:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:10,636 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 347 transitions. [2022-04-28 13:27:10,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:27:10,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 347 transitions. [2022-04-28 13:27:11,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 347 transitions. [2022-04-28 13:27:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 13:27:11,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:11,210 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:11,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 13:27:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 13:27:11,411 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 9 times [2022-04-28 13:27:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:11,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636310526] [2022-04-28 13:27:14,570 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:14,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 10 times [2022-04-28 13:27:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:14,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811453407] [2022-04-28 13:27:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:14,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:14,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165195958] [2022-04-28 13:27:14,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:27:14,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:14,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:14,582 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:14,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 13:27:14,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:27:14,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:14,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 13:27:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:15,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {32391#true} call ULTIMATE.init(); {32391#true} is VALID [2022-04-28 13:27:15,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {32391#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; {32399#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:15,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {32399#(<= ~counter~0 0)} assume true; {32399#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:15,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32399#(<= ~counter~0 0)} {32391#true} #92#return; {32399#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:15,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {32399#(<= ~counter~0 0)} call #t~ret7 := main(); {32399#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:15,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {32399#(<= ~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; {32399#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:15,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {32399#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {32415#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,194 INFO L272 TraceCheckUtils]: 8: Hoare triple {32415#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {32415#(<= ~counter~0 1)} ~cond := #in~cond; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {32415#(<= ~counter~0 1)} assume !(0 == ~cond); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {32415#(<= ~counter~0 1)} assume true; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,195 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32415#(<= ~counter~0 1)} {32415#(<= ~counter~0 1)} #78#return; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,196 INFO L272 TraceCheckUtils]: 13: Hoare triple {32415#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {32415#(<= ~counter~0 1)} ~cond := #in~cond; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {32415#(<= ~counter~0 1)} assume !(0 == ~cond); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {32415#(<= ~counter~0 1)} assume true; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,197 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32415#(<= ~counter~0 1)} {32415#(<= ~counter~0 1)} #80#return; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,197 INFO L272 TraceCheckUtils]: 18: Hoare triple {32415#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {32415#(<= ~counter~0 1)} ~cond := #in~cond; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {32415#(<= ~counter~0 1)} assume !(0 == ~cond); {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {32415#(<= ~counter~0 1)} assume true; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,198 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32415#(<= ~counter~0 1)} {32415#(<= ~counter~0 1)} #82#return; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {32415#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32415#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:15,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {32415#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {32470#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,199 INFO L272 TraceCheckUtils]: 26: Hoare triple {32470#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {32470#(<= ~counter~0 2)} ~cond := #in~cond; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {32470#(<= ~counter~0 2)} assume !(0 == ~cond); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {32470#(<= ~counter~0 2)} assume true; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,201 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32470#(<= ~counter~0 2)} {32470#(<= ~counter~0 2)} #78#return; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,201 INFO L272 TraceCheckUtils]: 31: Hoare triple {32470#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {32470#(<= ~counter~0 2)} ~cond := #in~cond; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {32470#(<= ~counter~0 2)} assume !(0 == ~cond); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {32470#(<= ~counter~0 2)} assume true; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,202 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32470#(<= ~counter~0 2)} {32470#(<= ~counter~0 2)} #80#return; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,202 INFO L272 TraceCheckUtils]: 36: Hoare triple {32470#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {32470#(<= ~counter~0 2)} ~cond := #in~cond; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {32470#(<= ~counter~0 2)} assume !(0 == ~cond); {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {32470#(<= ~counter~0 2)} assume true; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,203 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32470#(<= ~counter~0 2)} {32470#(<= ~counter~0 2)} #82#return; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {32470#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32470#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:15,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {32470#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {32525#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,205 INFO L272 TraceCheckUtils]: 44: Hoare triple {32525#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {32525#(<= ~counter~0 3)} ~cond := #in~cond; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {32525#(<= ~counter~0 3)} assume !(0 == ~cond); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {32525#(<= ~counter~0 3)} assume true; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,206 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32525#(<= ~counter~0 3)} {32525#(<= ~counter~0 3)} #78#return; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,206 INFO L272 TraceCheckUtils]: 49: Hoare triple {32525#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,206 INFO L290 TraceCheckUtils]: 50: Hoare triple {32525#(<= ~counter~0 3)} ~cond := #in~cond; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {32525#(<= ~counter~0 3)} assume !(0 == ~cond); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {32525#(<= ~counter~0 3)} assume true; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,207 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32525#(<= ~counter~0 3)} {32525#(<= ~counter~0 3)} #80#return; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,208 INFO L272 TraceCheckUtils]: 54: Hoare triple {32525#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {32525#(<= ~counter~0 3)} ~cond := #in~cond; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {32525#(<= ~counter~0 3)} assume !(0 == ~cond); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {32525#(<= ~counter~0 3)} assume true; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,209 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32525#(<= ~counter~0 3)} {32525#(<= ~counter~0 3)} #82#return; {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {32525#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {32525#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:15,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {32525#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {32580#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,210 INFO L272 TraceCheckUtils]: 62: Hoare triple {32580#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {32580#(<= ~counter~0 4)} ~cond := #in~cond; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,211 INFO L290 TraceCheckUtils]: 64: Hoare triple {32580#(<= ~counter~0 4)} assume !(0 == ~cond); {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {32580#(<= ~counter~0 4)} assume true; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,212 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32580#(<= ~counter~0 4)} {32580#(<= ~counter~0 4)} #84#return; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,212 INFO L272 TraceCheckUtils]: 67: Hoare triple {32580#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {32580#(<= ~counter~0 4)} ~cond := #in~cond; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {32580#(<= ~counter~0 4)} assume !(0 == ~cond); {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {32580#(<= ~counter~0 4)} assume true; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,213 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32580#(<= ~counter~0 4)} {32580#(<= ~counter~0 4)} #86#return; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {32580#(<= ~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); {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {32580#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32580#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:15,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {32580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {32623#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,216 INFO L272 TraceCheckUtils]: 76: Hoare triple {32623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,216 INFO L290 TraceCheckUtils]: 77: Hoare triple {32623#(<= ~counter~0 5)} ~cond := #in~cond; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,216 INFO L290 TraceCheckUtils]: 78: Hoare triple {32623#(<= ~counter~0 5)} assume !(0 == ~cond); {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {32623#(<= ~counter~0 5)} assume true; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,217 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32623#(<= ~counter~0 5)} {32623#(<= ~counter~0 5)} #84#return; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,218 INFO L272 TraceCheckUtils]: 81: Hoare triple {32623#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,218 INFO L290 TraceCheckUtils]: 82: Hoare triple {32623#(<= ~counter~0 5)} ~cond := #in~cond; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,218 INFO L290 TraceCheckUtils]: 83: Hoare triple {32623#(<= ~counter~0 5)} assume !(0 == ~cond); {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {32623#(<= ~counter~0 5)} assume true; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,219 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32623#(<= ~counter~0 5)} {32623#(<= ~counter~0 5)} #86#return; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,219 INFO L290 TraceCheckUtils]: 86: Hoare triple {32623#(<= ~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); {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,219 INFO L290 TraceCheckUtils]: 87: Hoare triple {32623#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32623#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:15,220 INFO L290 TraceCheckUtils]: 88: Hoare triple {32623#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,220 INFO L290 TraceCheckUtils]: 89: Hoare triple {32666#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,221 INFO L272 TraceCheckUtils]: 90: Hoare triple {32666#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,221 INFO L290 TraceCheckUtils]: 91: Hoare triple {32666#(<= ~counter~0 6)} ~cond := #in~cond; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {32666#(<= ~counter~0 6)} assume !(0 == ~cond); {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,222 INFO L290 TraceCheckUtils]: 93: Hoare triple {32666#(<= ~counter~0 6)} assume true; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,222 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32666#(<= ~counter~0 6)} {32666#(<= ~counter~0 6)} #84#return; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,222 INFO L272 TraceCheckUtils]: 95: Hoare triple {32666#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,223 INFO L290 TraceCheckUtils]: 96: Hoare triple {32666#(<= ~counter~0 6)} ~cond := #in~cond; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,223 INFO L290 TraceCheckUtils]: 97: Hoare triple {32666#(<= ~counter~0 6)} assume !(0 == ~cond); {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,223 INFO L290 TraceCheckUtils]: 98: Hoare triple {32666#(<= ~counter~0 6)} assume true; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,224 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32666#(<= ~counter~0 6)} {32666#(<= ~counter~0 6)} #86#return; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,224 INFO L290 TraceCheckUtils]: 100: Hoare triple {32666#(<= ~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); {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,224 INFO L290 TraceCheckUtils]: 101: Hoare triple {32666#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32666#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:15,225 INFO L290 TraceCheckUtils]: 102: Hoare triple {32666#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,225 INFO L290 TraceCheckUtils]: 103: Hoare triple {32709#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,226 INFO L272 TraceCheckUtils]: 104: Hoare triple {32709#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,226 INFO L290 TraceCheckUtils]: 105: Hoare triple {32709#(<= ~counter~0 7)} ~cond := #in~cond; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,226 INFO L290 TraceCheckUtils]: 106: Hoare triple {32709#(<= ~counter~0 7)} assume !(0 == ~cond); {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,227 INFO L290 TraceCheckUtils]: 107: Hoare triple {32709#(<= ~counter~0 7)} assume true; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,227 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32709#(<= ~counter~0 7)} {32709#(<= ~counter~0 7)} #84#return; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,228 INFO L272 TraceCheckUtils]: 109: Hoare triple {32709#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {32709#(<= ~counter~0 7)} ~cond := #in~cond; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,242 INFO L290 TraceCheckUtils]: 111: Hoare triple {32709#(<= ~counter~0 7)} assume !(0 == ~cond); {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,242 INFO L290 TraceCheckUtils]: 112: Hoare triple {32709#(<= ~counter~0 7)} assume true; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,243 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32709#(<= ~counter~0 7)} {32709#(<= ~counter~0 7)} #86#return; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,243 INFO L290 TraceCheckUtils]: 114: Hoare triple {32709#(<= ~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); {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,243 INFO L290 TraceCheckUtils]: 115: Hoare triple {32709#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32709#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:15,244 INFO L290 TraceCheckUtils]: 116: Hoare triple {32709#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32752#(<= |main_#t~post6| 7)} is VALID [2022-04-28 13:27:15,244 INFO L290 TraceCheckUtils]: 117: Hoare triple {32752#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {32392#false} is VALID [2022-04-28 13:27:15,244 INFO L272 TraceCheckUtils]: 118: Hoare triple {32392#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32392#false} is VALID [2022-04-28 13:27:15,244 INFO L290 TraceCheckUtils]: 119: Hoare triple {32392#false} ~cond := #in~cond; {32392#false} is VALID [2022-04-28 13:27:15,244 INFO L290 TraceCheckUtils]: 120: Hoare triple {32392#false} assume 0 == ~cond; {32392#false} is VALID [2022-04-28 13:27:15,244 INFO L290 TraceCheckUtils]: 121: Hoare triple {32392#false} assume !false; {32392#false} is VALID [2022-04-28 13:27:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 554 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 13:27:15,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:15,617 INFO L290 TraceCheckUtils]: 121: Hoare triple {32392#false} assume !false; {32392#false} is VALID [2022-04-28 13:27:15,617 INFO L290 TraceCheckUtils]: 120: Hoare triple {32392#false} assume 0 == ~cond; {32392#false} is VALID [2022-04-28 13:27:15,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {32392#false} ~cond := #in~cond; {32392#false} is VALID [2022-04-28 13:27:15,617 INFO L272 TraceCheckUtils]: 118: Hoare triple {32392#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32392#false} is VALID [2022-04-28 13:27:15,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {32780#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {32392#false} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 116: Hoare triple {32784#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32780#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 115: Hoare triple {32784#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 114: Hoare triple {32784#(< ~counter~0 100)} 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); {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,618 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32391#true} {32784#(< ~counter~0 100)} #86#return; {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 112: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 111: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,618 INFO L290 TraceCheckUtils]: 110: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L272 TraceCheckUtils]: 109: Hoare triple {32784#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32391#true} {32784#(< ~counter~0 100)} #84#return; {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,619 INFO L290 TraceCheckUtils]: 107: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L290 TraceCheckUtils]: 106: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L290 TraceCheckUtils]: 105: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L272 TraceCheckUtils]: 104: Hoare triple {32784#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,619 INFO L290 TraceCheckUtils]: 103: Hoare triple {32784#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,620 INFO L290 TraceCheckUtils]: 102: Hoare triple {32827#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32784#(< ~counter~0 100)} is VALID [2022-04-28 13:27:15,620 INFO L290 TraceCheckUtils]: 101: Hoare triple {32827#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,620 INFO L290 TraceCheckUtils]: 100: Hoare triple {32827#(< ~counter~0 99)} 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); {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,621 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32391#true} {32827#(< ~counter~0 99)} #86#return; {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,621 INFO L272 TraceCheckUtils]: 95: Hoare triple {32827#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,621 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32391#true} {32827#(< ~counter~0 99)} #84#return; {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,623 INFO L290 TraceCheckUtils]: 92: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,623 INFO L290 TraceCheckUtils]: 91: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,623 INFO L272 TraceCheckUtils]: 90: Hoare triple {32827#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,623 INFO L290 TraceCheckUtils]: 89: Hoare triple {32827#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {32870#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32827#(< ~counter~0 99)} is VALID [2022-04-28 13:27:15,624 INFO L290 TraceCheckUtils]: 87: Hoare triple {32870#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,624 INFO L290 TraceCheckUtils]: 86: Hoare triple {32870#(< ~counter~0 98)} 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); {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,624 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32391#true} {32870#(< ~counter~0 98)} #86#return; {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L272 TraceCheckUtils]: 81: Hoare triple {32870#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32391#true} {32870#(< ~counter~0 98)} #84#return; {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L272 TraceCheckUtils]: 76: Hoare triple {32870#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {32870#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {32913#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32870#(< ~counter~0 98)} is VALID [2022-04-28 13:27:15,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {32913#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {32913#(< ~counter~0 97)} 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); {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,626 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32391#true} {32913#(< ~counter~0 97)} #86#return; {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L272 TraceCheckUtils]: 67: Hoare triple {32913#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32391#true} {32913#(< ~counter~0 97)} #84#return; {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 64: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L272 TraceCheckUtils]: 62: Hoare triple {32913#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {32913#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {32956#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32913#(< ~counter~0 97)} is VALID [2022-04-28 13:27:15,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {32956#(< ~counter~0 96)} assume !(~r~0 >= ~d~0); {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,628 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32391#true} {32956#(< ~counter~0 96)} #82#return; {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,628 INFO L290 TraceCheckUtils]: 56: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L272 TraceCheckUtils]: 54: Hoare triple {32956#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32391#true} {32956#(< ~counter~0 96)} #80#return; {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L290 TraceCheckUtils]: 51: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L272 TraceCheckUtils]: 49: Hoare triple {32956#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,629 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32391#true} {32956#(< ~counter~0 96)} #78#return; {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,630 INFO L272 TraceCheckUtils]: 44: Hoare triple {32956#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {32956#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {33011#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32956#(< ~counter~0 96)} is VALID [2022-04-28 13:27:15,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {33011#(< ~counter~0 95)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,631 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32391#true} {33011#(< ~counter~0 95)} #82#return; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,631 INFO L272 TraceCheckUtils]: 36: Hoare triple {33011#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,634 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32391#true} {33011#(< ~counter~0 95)} #80#return; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L272 TraceCheckUtils]: 31: Hoare triple {33011#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32391#true} {33011#(< ~counter~0 95)} #78#return; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L272 TraceCheckUtils]: 26: Hoare triple {33011#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {33011#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {33066#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33011#(< ~counter~0 95)} is VALID [2022-04-28 13:27:15,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {33066#(< ~counter~0 94)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,636 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32391#true} {33066#(< ~counter~0 94)} #82#return; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,641 INFO L272 TraceCheckUtils]: 18: Hoare triple {33066#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32391#true} {33066#(< ~counter~0 94)} #80#return; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L272 TraceCheckUtils]: 13: Hoare triple {33066#(< ~counter~0 94)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32391#true} {33066#(< ~counter~0 94)} #78#return; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {32391#true} assume true; {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {32391#true} assume !(0 == ~cond); {32391#true} is VALID [2022-04-28 13:27:15,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {32391#true} ~cond := #in~cond; {32391#true} is VALID [2022-04-28 13:27:15,643 INFO L272 TraceCheckUtils]: 8: Hoare triple {33066#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32391#true} is VALID [2022-04-28 13:27:15,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {33066#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {33121#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33066#(< ~counter~0 94)} is VALID [2022-04-28 13:27:15,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {33121#(< ~counter~0 93)} 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; {33121#(< ~counter~0 93)} is VALID [2022-04-28 13:27:15,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {33121#(< ~counter~0 93)} call #t~ret7 := main(); {33121#(< ~counter~0 93)} is VALID [2022-04-28 13:27:15,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33121#(< ~counter~0 93)} {32391#true} #92#return; {33121#(< ~counter~0 93)} is VALID [2022-04-28 13:27:15,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {33121#(< ~counter~0 93)} assume true; {33121#(< ~counter~0 93)} is VALID [2022-04-28 13:27:15,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {32391#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; {33121#(< ~counter~0 93)} is VALID [2022-04-28 13:27:15,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {32391#true} call ULTIMATE.init(); {32391#true} is VALID [2022-04-28 13:27:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 62 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 13:27:15,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811453407] [2022-04-28 13:27:15,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:15,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165195958] [2022-04-28 13:27:15,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165195958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:15,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:15,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 13:27:15,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:15,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636310526] [2022-04-28 13:27:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636310526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:15,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:15,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:27:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8244406] [2022-04-28 13:27:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 13:27:15,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:15,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:27:15,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:15,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:27:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:15,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:27:15,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 13:27:15,719 INFO L87 Difference]: Start difference. First operand 313 states and 347 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:27:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:16,592 INFO L93 Difference]: Finished difference Result 407 states and 461 transitions. [2022-04-28 13:27:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 13:27:16,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 13:27:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:27:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 13:27:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:27:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 13:27:16,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-04-28 13:27:16,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:16,713 INFO L225 Difference]: With dead ends: 407 [2022-04-28 13:27:16,714 INFO L226 Difference]: Without dead ends: 394 [2022-04-28 13:27:16,714 INFO L412 NwaCegarLoop]: 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-28 13:27:16,714 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:16,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:27:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-28 13:27:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2022-04-28 13:27:17,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:17,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:17,066 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:17,067 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:17,073 INFO L93 Difference]: Finished difference Result 394 states and 440 transitions. [2022-04-28 13:27:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 440 transitions. [2022-04-28 13:27:17,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:17,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:17,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 394 states. [2022-04-28 13:27:17,076 INFO L87 Difference]: Start difference. First operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 394 states. [2022-04-28 13:27:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:17,082 INFO L93 Difference]: Finished difference Result 394 states and 440 transitions. [2022-04-28 13:27:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 440 transitions. [2022-04-28 13:27:17,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:17,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:17,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:17,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 270 states have (on average 1.1074074074074074) internal successors, (299), 276 states have internal predecessors, (299), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 439 transitions. [2022-04-28 13:27:17,092 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 439 transitions. Word has length 122 [2022-04-28 13:27:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:17,092 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 439 transitions. [2022-04-28 13:27:17,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:27:17,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 439 transitions. [2022-04-28 13:27:17,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 439 transitions. [2022-04-28 13:27:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 13:27:17,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:17,902 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:17,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 13:27:18,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:18,116 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 3 times [2022-04-28 13:27:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:18,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [134482878] [2022-04-28 13:27:22,198 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:22,198 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 4 times [2022-04-28 13:27:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:22,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992396817] [2022-04-28 13:27:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:22,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:22,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37349151] [2022-04-28 13:27:22,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:27:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:22,210 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:22,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 13:27:22,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:27:22,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:22,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:27:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:22,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:22,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {35538#true} call ULTIMATE.init(); {35538#true} is VALID [2022-04-28 13:27:22,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {35538#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; {35546#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:22,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {35546#(<= ~counter~0 0)} assume true; {35546#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:22,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35546#(<= ~counter~0 0)} {35538#true} #92#return; {35546#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:22,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {35546#(<= ~counter~0 0)} call #t~ret7 := main(); {35546#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:22,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {35546#(<= ~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; {35546#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:22,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {35546#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {35562#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,800 INFO L272 TraceCheckUtils]: 8: Hoare triple {35562#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {35562#(<= ~counter~0 1)} ~cond := #in~cond; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {35562#(<= ~counter~0 1)} assume !(0 == ~cond); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {35562#(<= ~counter~0 1)} assume true; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,823 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35562#(<= ~counter~0 1)} {35562#(<= ~counter~0 1)} #78#return; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,823 INFO L272 TraceCheckUtils]: 13: Hoare triple {35562#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {35562#(<= ~counter~0 1)} ~cond := #in~cond; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {35562#(<= ~counter~0 1)} assume !(0 == ~cond); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {35562#(<= ~counter~0 1)} assume true; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,824 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35562#(<= ~counter~0 1)} {35562#(<= ~counter~0 1)} #80#return; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,824 INFO L272 TraceCheckUtils]: 18: Hoare triple {35562#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {35562#(<= ~counter~0 1)} ~cond := #in~cond; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {35562#(<= ~counter~0 1)} assume !(0 == ~cond); {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {35562#(<= ~counter~0 1)} assume true; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,825 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35562#(<= ~counter~0 1)} {35562#(<= ~counter~0 1)} #82#return; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {35562#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35562#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:22,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {35562#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {35617#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,827 INFO L272 TraceCheckUtils]: 26: Hoare triple {35617#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {35617#(<= ~counter~0 2)} ~cond := #in~cond; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {35617#(<= ~counter~0 2)} assume !(0 == ~cond); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {35617#(<= ~counter~0 2)} assume true; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,828 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35617#(<= ~counter~0 2)} {35617#(<= ~counter~0 2)} #78#return; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,828 INFO L272 TraceCheckUtils]: 31: Hoare triple {35617#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {35617#(<= ~counter~0 2)} ~cond := #in~cond; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {35617#(<= ~counter~0 2)} assume !(0 == ~cond); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {35617#(<= ~counter~0 2)} assume true; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,829 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35617#(<= ~counter~0 2)} {35617#(<= ~counter~0 2)} #80#return; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,829 INFO L272 TraceCheckUtils]: 36: Hoare triple {35617#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {35617#(<= ~counter~0 2)} ~cond := #in~cond; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {35617#(<= ~counter~0 2)} assume !(0 == ~cond); {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {35617#(<= ~counter~0 2)} assume true; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,830 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35617#(<= ~counter~0 2)} {35617#(<= ~counter~0 2)} #82#return; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {35617#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35617#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:22,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {35617#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {35672#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,831 INFO L272 TraceCheckUtils]: 44: Hoare triple {35672#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {35672#(<= ~counter~0 3)} ~cond := #in~cond; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {35672#(<= ~counter~0 3)} assume !(0 == ~cond); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {35672#(<= ~counter~0 3)} assume true; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,832 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35672#(<= ~counter~0 3)} {35672#(<= ~counter~0 3)} #78#return; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,832 INFO L272 TraceCheckUtils]: 49: Hoare triple {35672#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {35672#(<= ~counter~0 3)} ~cond := #in~cond; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {35672#(<= ~counter~0 3)} assume !(0 == ~cond); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {35672#(<= ~counter~0 3)} assume true; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,833 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35672#(<= ~counter~0 3)} {35672#(<= ~counter~0 3)} #80#return; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,834 INFO L272 TraceCheckUtils]: 54: Hoare triple {35672#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {35672#(<= ~counter~0 3)} ~cond := #in~cond; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {35672#(<= ~counter~0 3)} assume !(0 == ~cond); {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {35672#(<= ~counter~0 3)} assume true; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,835 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35672#(<= ~counter~0 3)} {35672#(<= ~counter~0 3)} #82#return; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {35672#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35672#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:22,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {35672#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {35727#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,836 INFO L272 TraceCheckUtils]: 62: Hoare triple {35727#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {35727#(<= ~counter~0 4)} ~cond := #in~cond; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {35727#(<= ~counter~0 4)} assume !(0 == ~cond); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {35727#(<= ~counter~0 4)} assume true; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,837 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35727#(<= ~counter~0 4)} {35727#(<= ~counter~0 4)} #78#return; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,837 INFO L272 TraceCheckUtils]: 67: Hoare triple {35727#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {35727#(<= ~counter~0 4)} ~cond := #in~cond; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {35727#(<= ~counter~0 4)} assume !(0 == ~cond); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,838 INFO L290 TraceCheckUtils]: 70: Hoare triple {35727#(<= ~counter~0 4)} assume true; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,838 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35727#(<= ~counter~0 4)} {35727#(<= ~counter~0 4)} #80#return; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,839 INFO L272 TraceCheckUtils]: 72: Hoare triple {35727#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,839 INFO L290 TraceCheckUtils]: 73: Hoare triple {35727#(<= ~counter~0 4)} ~cond := #in~cond; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,839 INFO L290 TraceCheckUtils]: 74: Hoare triple {35727#(<= ~counter~0 4)} assume !(0 == ~cond); {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {35727#(<= ~counter~0 4)} assume true; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,840 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35727#(<= ~counter~0 4)} {35727#(<= ~counter~0 4)} #82#return; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {35727#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35727#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:22,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {35727#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {35782#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,841 INFO L272 TraceCheckUtils]: 80: Hoare triple {35782#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {35782#(<= ~counter~0 5)} ~cond := #in~cond; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,842 INFO L290 TraceCheckUtils]: 82: Hoare triple {35782#(<= ~counter~0 5)} assume !(0 == ~cond); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,842 INFO L290 TraceCheckUtils]: 83: Hoare triple {35782#(<= ~counter~0 5)} assume true; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,842 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35782#(<= ~counter~0 5)} {35782#(<= ~counter~0 5)} #78#return; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,842 INFO L272 TraceCheckUtils]: 85: Hoare triple {35782#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {35782#(<= ~counter~0 5)} ~cond := #in~cond; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,843 INFO L290 TraceCheckUtils]: 87: Hoare triple {35782#(<= ~counter~0 5)} assume !(0 == ~cond); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,843 INFO L290 TraceCheckUtils]: 88: Hoare triple {35782#(<= ~counter~0 5)} assume true; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,843 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35782#(<= ~counter~0 5)} {35782#(<= ~counter~0 5)} #80#return; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,844 INFO L272 TraceCheckUtils]: 90: Hoare triple {35782#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,844 INFO L290 TraceCheckUtils]: 91: Hoare triple {35782#(<= ~counter~0 5)} ~cond := #in~cond; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,844 INFO L290 TraceCheckUtils]: 92: Hoare triple {35782#(<= ~counter~0 5)} assume !(0 == ~cond); {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,844 INFO L290 TraceCheckUtils]: 93: Hoare triple {35782#(<= ~counter~0 5)} assume true; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,845 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35782#(<= ~counter~0 5)} {35782#(<= ~counter~0 5)} #82#return; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,845 INFO L290 TraceCheckUtils]: 95: Hoare triple {35782#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35782#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:22,845 INFO L290 TraceCheckUtils]: 96: Hoare triple {35782#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,846 INFO L290 TraceCheckUtils]: 97: Hoare triple {35837#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,846 INFO L272 TraceCheckUtils]: 98: Hoare triple {35837#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,846 INFO L290 TraceCheckUtils]: 99: Hoare triple {35837#(<= ~counter~0 6)} ~cond := #in~cond; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {35837#(<= ~counter~0 6)} assume !(0 == ~cond); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,847 INFO L290 TraceCheckUtils]: 101: Hoare triple {35837#(<= ~counter~0 6)} assume true; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,847 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35837#(<= ~counter~0 6)} {35837#(<= ~counter~0 6)} #78#return; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,847 INFO L272 TraceCheckUtils]: 103: Hoare triple {35837#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,847 INFO L290 TraceCheckUtils]: 104: Hoare triple {35837#(<= ~counter~0 6)} ~cond := #in~cond; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,848 INFO L290 TraceCheckUtils]: 105: Hoare triple {35837#(<= ~counter~0 6)} assume !(0 == ~cond); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,848 INFO L290 TraceCheckUtils]: 106: Hoare triple {35837#(<= ~counter~0 6)} assume true; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,849 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35837#(<= ~counter~0 6)} {35837#(<= ~counter~0 6)} #80#return; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,849 INFO L272 TraceCheckUtils]: 108: Hoare triple {35837#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {35837#(<= ~counter~0 6)} ~cond := #in~cond; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {35837#(<= ~counter~0 6)} assume !(0 == ~cond); {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {35837#(<= ~counter~0 6)} assume true; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,850 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35837#(<= ~counter~0 6)} {35837#(<= ~counter~0 6)} #82#return; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {35837#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35837#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:22,850 INFO L290 TraceCheckUtils]: 114: Hoare triple {35837#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35892#(<= |main_#t~post5| 6)} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 115: Hoare triple {35892#(<= |main_#t~post5| 6)} assume !(#t~post5 < 100);havoc #t~post5; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 116: Hoare triple {35539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 117: Hoare triple {35539#false} assume !!(#t~post6 < 100);havoc #t~post6; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L272 TraceCheckUtils]: 118: Hoare triple {35539#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 119: Hoare triple {35539#false} ~cond := #in~cond; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 120: Hoare triple {35539#false} assume !(0 == ~cond); {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 121: Hoare triple {35539#false} assume true; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35539#false} {35539#false} #84#return; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L272 TraceCheckUtils]: 123: Hoare triple {35539#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 124: Hoare triple {35539#false} ~cond := #in~cond; {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 125: Hoare triple {35539#false} assume !(0 == ~cond); {35539#false} is VALID [2022-04-28 13:27:22,851 INFO L290 TraceCheckUtils]: 126: Hoare triple {35539#false} assume true; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35539#false} {35539#false} #86#return; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 128: Hoare triple {35539#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); {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 129: Hoare triple {35539#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 130: Hoare triple {35539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 131: Hoare triple {35539#false} assume !(#t~post6 < 100);havoc #t~post6; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L272 TraceCheckUtils]: 132: Hoare triple {35539#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 133: Hoare triple {35539#false} ~cond := #in~cond; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 134: Hoare triple {35539#false} assume 0 == ~cond; {35539#false} is VALID [2022-04-28 13:27:22,852 INFO L290 TraceCheckUtils]: 135: Hoare triple {35539#false} assume !false; {35539#false} is VALID [2022-04-28 13:27:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 180 proven. 642 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 13:27:22,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:23,240 INFO L290 TraceCheckUtils]: 135: Hoare triple {35539#false} assume !false; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 134: Hoare triple {35539#false} assume 0 == ~cond; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 133: Hoare triple {35539#false} ~cond := #in~cond; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L272 TraceCheckUtils]: 132: Hoare triple {35539#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 131: Hoare triple {35539#false} assume !(#t~post6 < 100);havoc #t~post6; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 130: Hoare triple {35539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 129: Hoare triple {35539#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 128: Hoare triple {35539#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); {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35538#true} {35539#false} #86#return; {35539#false} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 126: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 125: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,241 INFO L290 TraceCheckUtils]: 124: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,241 INFO L272 TraceCheckUtils]: 123: Hoare triple {35539#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,242 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35538#true} {35539#false} #84#return; {35539#false} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 121: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 120: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 119: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,242 INFO L272 TraceCheckUtils]: 118: Hoare triple {35539#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 117: Hoare triple {35539#false} assume !!(#t~post6 < 100);havoc #t~post6; {35539#false} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 116: Hoare triple {35539#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35539#false} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 115: Hoare triple {36016#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {35539#false} is VALID [2022-04-28 13:27:23,242 INFO L290 TraceCheckUtils]: 114: Hoare triple {36020#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36016#(< |main_#t~post5| 100)} is VALID [2022-04-28 13:27:23,243 INFO L290 TraceCheckUtils]: 113: Hoare triple {36020#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,243 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35538#true} {36020#(< ~counter~0 100)} #82#return; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,243 INFO L290 TraceCheckUtils]: 111: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,243 INFO L290 TraceCheckUtils]: 110: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,243 INFO L290 TraceCheckUtils]: 109: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,243 INFO L272 TraceCheckUtils]: 108: Hoare triple {36020#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35538#true} {36020#(< ~counter~0 100)} #80#return; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 106: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 105: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 104: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L272 TraceCheckUtils]: 103: Hoare triple {36020#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35538#true} {36020#(< ~counter~0 100)} #78#return; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,245 INFO L272 TraceCheckUtils]: 98: Hoare triple {36020#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,245 INFO L290 TraceCheckUtils]: 97: Hoare triple {36020#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,246 INFO L290 TraceCheckUtils]: 96: Hoare triple {36075#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36020#(< ~counter~0 100)} is VALID [2022-04-28 13:27:23,246 INFO L290 TraceCheckUtils]: 95: Hoare triple {36075#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,246 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35538#true} {36075#(< ~counter~0 99)} #82#return; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,246 INFO L290 TraceCheckUtils]: 93: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,246 INFO L290 TraceCheckUtils]: 92: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,246 INFO L290 TraceCheckUtils]: 91: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L272 TraceCheckUtils]: 90: Hoare triple {36075#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35538#true} {36075#(< ~counter~0 99)} #80#return; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L290 TraceCheckUtils]: 87: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L272 TraceCheckUtils]: 85: Hoare triple {36075#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,247 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35538#true} {36075#(< ~counter~0 99)} #78#return; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,248 INFO L272 TraceCheckUtils]: 80: Hoare triple {36075#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {36075#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {36130#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36075#(< ~counter~0 99)} is VALID [2022-04-28 13:27:23,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {36130#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,249 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35538#true} {36130#(< ~counter~0 98)} #82#return; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,249 INFO L290 TraceCheckUtils]: 75: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,249 INFO L290 TraceCheckUtils]: 74: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,249 INFO L290 TraceCheckUtils]: 73: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,249 INFO L272 TraceCheckUtils]: 72: Hoare triple {36130#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35538#true} {36130#(< ~counter~0 98)} #80#return; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L272 TraceCheckUtils]: 67: Hoare triple {36130#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35538#true} {36130#(< ~counter~0 98)} #78#return; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,250 INFO L272 TraceCheckUtils]: 62: Hoare triple {36130#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {36130#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {36185#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36130#(< ~counter~0 98)} is VALID [2022-04-28 13:27:23,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {36185#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,252 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35538#true} {36185#(< ~counter~0 97)} #82#return; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 56: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 55: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L272 TraceCheckUtils]: 54: Hoare triple {36185#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35538#true} {36185#(< ~counter~0 97)} #80#return; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L272 TraceCheckUtils]: 49: Hoare triple {36185#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35538#true} {36185#(< ~counter~0 97)} #78#return; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,253 INFO L290 TraceCheckUtils]: 47: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L290 TraceCheckUtils]: 46: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L272 TraceCheckUtils]: 44: Hoare triple {36185#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {36185#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {36240#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36185#(< ~counter~0 97)} is VALID [2022-04-28 13:27:23,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {36240#(< ~counter~0 96)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,254 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35538#true} {36240#(< ~counter~0 96)} #82#return; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L272 TraceCheckUtils]: 36: Hoare triple {36240#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35538#true} {36240#(< ~counter~0 96)} #80#return; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,255 INFO L272 TraceCheckUtils]: 31: Hoare triple {36240#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,256 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35538#true} {36240#(< ~counter~0 96)} #78#return; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,256 INFO L272 TraceCheckUtils]: 26: Hoare triple {36240#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {36240#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {36295#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36240#(< ~counter~0 96)} is VALID [2022-04-28 13:27:23,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {36295#(< ~counter~0 95)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,257 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35538#true} {36295#(< ~counter~0 95)} #82#return; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {36295#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35538#true} {36295#(< ~counter~0 95)} #80#return; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L272 TraceCheckUtils]: 13: Hoare triple {36295#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35538#true} {36295#(< ~counter~0 95)} #78#return; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {35538#true} assume true; {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {35538#true} assume !(0 == ~cond); {35538#true} is VALID [2022-04-28 13:27:23,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {35538#true} ~cond := #in~cond; {35538#true} is VALID [2022-04-28 13:27:23,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {36295#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35538#true} is VALID [2022-04-28 13:27:23,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {36295#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {36350#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36295#(< ~counter~0 95)} is VALID [2022-04-28 13:27:23,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {36350#(< ~counter~0 94)} 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; {36350#(< ~counter~0 94)} is VALID [2022-04-28 13:27:23,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {36350#(< ~counter~0 94)} call #t~ret7 := main(); {36350#(< ~counter~0 94)} is VALID [2022-04-28 13:27:23,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36350#(< ~counter~0 94)} {35538#true} #92#return; {36350#(< ~counter~0 94)} is VALID [2022-04-28 13:27:23,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {36350#(< ~counter~0 94)} assume true; {36350#(< ~counter~0 94)} is VALID [2022-04-28 13:27:23,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {35538#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; {36350#(< ~counter~0 94)} is VALID [2022-04-28 13:27:23,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {35538#true} call ULTIMATE.init(); {35538#true} is VALID [2022-04-28 13:27:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 40 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2022-04-28 13:27:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:23,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992396817] [2022-04-28 13:27:23,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:23,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37349151] [2022-04-28 13:27:23,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37349151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:23,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:23,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 13:27:23,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [134482878] [2022-04-28 13:27:23,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [134482878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:23,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:23,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:27:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821528037] [2022-04-28 13:27:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:23,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 13:27:23,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:23,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:27:23,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:23,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:27:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:27:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:27:23,328 INFO L87 Difference]: Start difference. First operand 393 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:27:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:24,150 INFO L93 Difference]: Finished difference Result 446 states and 501 transitions. [2022-04-28 13:27:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 13:27:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 13:27:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:27:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 13:27:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:27:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 13:27:24,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 158 transitions. [2022-04-28 13:27:24,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:24,275 INFO L225 Difference]: With dead ends: 446 [2022-04-28 13:27:24,275 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 13:27:24,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:27:24,277 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:24,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 207 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:27:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 13:27:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2022-04-28 13:27:24,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:24,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:24,844 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:24,845 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:24,851 INFO L93 Difference]: Finished difference Result 391 states and 436 transitions. [2022-04-28 13:27:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 13:27:24,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:24,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:24,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 391 states. [2022-04-28 13:27:24,854 INFO L87 Difference]: Start difference. First operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 391 states. [2022-04-28 13:27:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:24,860 INFO L93 Difference]: Finished difference Result 391 states and 436 transitions. [2022-04-28 13:27:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 13:27:24,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:24,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:24,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:24,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 268 states have (on average 1.1044776119402986) internal successors, (296), 274 states have internal predecessors, (296), 71 states have call successors, (71), 52 states have call predecessors, (71), 51 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 13:27:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 436 transitions. [2022-04-28 13:27:24,869 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 436 transitions. Word has length 136 [2022-04-28 13:27:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 436 transitions. [2022-04-28 13:27:24,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:27:24,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 436 transitions. [2022-04-28 13:27:25,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 436 transitions. [2022-04-28 13:27:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 13:27:25,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:25,616 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:25,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 13:27:25,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 13:27:25,817 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 11 times [2022-04-28 13:27:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:25,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999952607] [2022-04-28 13:27:29,909 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:29,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:29,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 12 times [2022-04-28 13:27:29,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:29,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752948025] [2022-04-28 13:27:29,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:29,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855539265] [2022-04-28 13:27:29,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:27:29,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:29,929 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:29,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 13:27:30,028 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 13:27:30,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:30,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 13:27:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:30,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:30,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {38839#true} call ULTIMATE.init(); {38839#true} is VALID [2022-04-28 13:27:30,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {38839#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; {38847#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:30,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {38847#(<= ~counter~0 0)} assume true; {38847#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:30,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38847#(<= ~counter~0 0)} {38839#true} #92#return; {38847#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:30,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {38847#(<= ~counter~0 0)} call #t~ret7 := main(); {38847#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:30,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {38847#(<= ~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; {38847#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:30,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {38847#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {38863#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,624 INFO L272 TraceCheckUtils]: 8: Hoare triple {38863#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {38863#(<= ~counter~0 1)} ~cond := #in~cond; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {38863#(<= ~counter~0 1)} assume !(0 == ~cond); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {38863#(<= ~counter~0 1)} assume true; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,625 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38863#(<= ~counter~0 1)} {38863#(<= ~counter~0 1)} #78#return; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,626 INFO L272 TraceCheckUtils]: 13: Hoare triple {38863#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {38863#(<= ~counter~0 1)} ~cond := #in~cond; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {38863#(<= ~counter~0 1)} assume !(0 == ~cond); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {38863#(<= ~counter~0 1)} assume true; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,627 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38863#(<= ~counter~0 1)} {38863#(<= ~counter~0 1)} #80#return; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,627 INFO L272 TraceCheckUtils]: 18: Hoare triple {38863#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {38863#(<= ~counter~0 1)} ~cond := #in~cond; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {38863#(<= ~counter~0 1)} assume !(0 == ~cond); {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {38863#(<= ~counter~0 1)} assume true; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,628 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38863#(<= ~counter~0 1)} {38863#(<= ~counter~0 1)} #82#return; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {38863#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38863#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:30,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {38863#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {38918#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,630 INFO L272 TraceCheckUtils]: 26: Hoare triple {38918#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {38918#(<= ~counter~0 2)} ~cond := #in~cond; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {38918#(<= ~counter~0 2)} assume !(0 == ~cond); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {38918#(<= ~counter~0 2)} assume true; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,631 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38918#(<= ~counter~0 2)} {38918#(<= ~counter~0 2)} #78#return; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,631 INFO L272 TraceCheckUtils]: 31: Hoare triple {38918#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {38918#(<= ~counter~0 2)} ~cond := #in~cond; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {38918#(<= ~counter~0 2)} assume !(0 == ~cond); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {38918#(<= ~counter~0 2)} assume true; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,632 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38918#(<= ~counter~0 2)} {38918#(<= ~counter~0 2)} #80#return; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,633 INFO L272 TraceCheckUtils]: 36: Hoare triple {38918#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {38918#(<= ~counter~0 2)} ~cond := #in~cond; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {38918#(<= ~counter~0 2)} assume !(0 == ~cond); {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {38918#(<= ~counter~0 2)} assume true; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,634 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38918#(<= ~counter~0 2)} {38918#(<= ~counter~0 2)} #82#return; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {38918#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38918#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:30,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {38918#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {38973#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,636 INFO L272 TraceCheckUtils]: 44: Hoare triple {38973#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {38973#(<= ~counter~0 3)} ~cond := #in~cond; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {38973#(<= ~counter~0 3)} assume !(0 == ~cond); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {38973#(<= ~counter~0 3)} assume true; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,637 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38973#(<= ~counter~0 3)} {38973#(<= ~counter~0 3)} #78#return; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,637 INFO L272 TraceCheckUtils]: 49: Hoare triple {38973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {38973#(<= ~counter~0 3)} ~cond := #in~cond; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {38973#(<= ~counter~0 3)} assume !(0 == ~cond); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {38973#(<= ~counter~0 3)} assume true; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,638 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38973#(<= ~counter~0 3)} {38973#(<= ~counter~0 3)} #80#return; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,639 INFO L272 TraceCheckUtils]: 54: Hoare triple {38973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {38973#(<= ~counter~0 3)} ~cond := #in~cond; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {38973#(<= ~counter~0 3)} assume !(0 == ~cond); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {38973#(<= ~counter~0 3)} assume true; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,640 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38973#(<= ~counter~0 3)} {38973#(<= ~counter~0 3)} #82#return; {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {38973#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {38973#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:30,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {38973#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {39028#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,641 INFO L272 TraceCheckUtils]: 62: Hoare triple {39028#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {39028#(<= ~counter~0 4)} ~cond := #in~cond; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {39028#(<= ~counter~0 4)} assume !(0 == ~cond); {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {39028#(<= ~counter~0 4)} assume true; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,643 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {39028#(<= ~counter~0 4)} {39028#(<= ~counter~0 4)} #84#return; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,643 INFO L272 TraceCheckUtils]: 67: Hoare triple {39028#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {39028#(<= ~counter~0 4)} ~cond := #in~cond; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {39028#(<= ~counter~0 4)} assume !(0 == ~cond); {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {39028#(<= ~counter~0 4)} assume true; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,644 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39028#(<= ~counter~0 4)} {39028#(<= ~counter~0 4)} #86#return; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {39028#(<= ~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); {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,645 INFO L290 TraceCheckUtils]: 73: Hoare triple {39028#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39028#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:30,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {39028#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {39071#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,646 INFO L272 TraceCheckUtils]: 76: Hoare triple {39071#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {39071#(<= ~counter~0 5)} ~cond := #in~cond; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {39071#(<= ~counter~0 5)} assume !(0 == ~cond); {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {39071#(<= ~counter~0 5)} assume true; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,647 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {39071#(<= ~counter~0 5)} {39071#(<= ~counter~0 5)} #84#return; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,648 INFO L272 TraceCheckUtils]: 81: Hoare triple {39071#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {39071#(<= ~counter~0 5)} ~cond := #in~cond; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {39071#(<= ~counter~0 5)} assume !(0 == ~cond); {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,649 INFO L290 TraceCheckUtils]: 84: Hoare triple {39071#(<= ~counter~0 5)} assume true; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,649 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {39071#(<= ~counter~0 5)} {39071#(<= ~counter~0 5)} #86#return; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,649 INFO L290 TraceCheckUtils]: 86: Hoare triple {39071#(<= ~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); {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,649 INFO L290 TraceCheckUtils]: 87: Hoare triple {39071#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39071#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:30,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {39071#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,650 INFO L290 TraceCheckUtils]: 89: Hoare triple {39114#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,651 INFO L272 TraceCheckUtils]: 90: Hoare triple {39114#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {39114#(<= ~counter~0 6)} ~cond := #in~cond; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {39114#(<= ~counter~0 6)} assume !(0 == ~cond); {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {39114#(<= ~counter~0 6)} assume true; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,652 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {39114#(<= ~counter~0 6)} {39114#(<= ~counter~0 6)} #84#return; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,652 INFO L272 TraceCheckUtils]: 95: Hoare triple {39114#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {39114#(<= ~counter~0 6)} ~cond := #in~cond; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,653 INFO L290 TraceCheckUtils]: 97: Hoare triple {39114#(<= ~counter~0 6)} assume !(0 == ~cond); {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,653 INFO L290 TraceCheckUtils]: 98: Hoare triple {39114#(<= ~counter~0 6)} assume true; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,654 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {39114#(<= ~counter~0 6)} {39114#(<= ~counter~0 6)} #86#return; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {39114#(<= ~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); {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {39114#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39114#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:30,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {39114#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,655 INFO L290 TraceCheckUtils]: 103: Hoare triple {39157#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,655 INFO L272 TraceCheckUtils]: 104: Hoare triple {39157#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,656 INFO L290 TraceCheckUtils]: 105: Hoare triple {39157#(<= ~counter~0 7)} ~cond := #in~cond; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,656 INFO L290 TraceCheckUtils]: 106: Hoare triple {39157#(<= ~counter~0 7)} assume !(0 == ~cond); {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,656 INFO L290 TraceCheckUtils]: 107: Hoare triple {39157#(<= ~counter~0 7)} assume true; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,657 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {39157#(<= ~counter~0 7)} {39157#(<= ~counter~0 7)} #84#return; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,657 INFO L272 TraceCheckUtils]: 109: Hoare triple {39157#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {39157#(<= ~counter~0 7)} ~cond := #in~cond; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,658 INFO L290 TraceCheckUtils]: 111: Hoare triple {39157#(<= ~counter~0 7)} assume !(0 == ~cond); {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,658 INFO L290 TraceCheckUtils]: 112: Hoare triple {39157#(<= ~counter~0 7)} assume true; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,658 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {39157#(<= ~counter~0 7)} {39157#(<= ~counter~0 7)} #86#return; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,659 INFO L290 TraceCheckUtils]: 114: Hoare triple {39157#(<= ~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); {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,659 INFO L290 TraceCheckUtils]: 115: Hoare triple {39157#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39157#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:30,659 INFO L290 TraceCheckUtils]: 116: Hoare triple {39157#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,660 INFO L290 TraceCheckUtils]: 117: Hoare triple {39200#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,660 INFO L272 TraceCheckUtils]: 118: Hoare triple {39200#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,660 INFO L290 TraceCheckUtils]: 119: Hoare triple {39200#(<= ~counter~0 8)} ~cond := #in~cond; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,661 INFO L290 TraceCheckUtils]: 120: Hoare triple {39200#(<= ~counter~0 8)} assume !(0 == ~cond); {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,661 INFO L290 TraceCheckUtils]: 121: Hoare triple {39200#(<= ~counter~0 8)} assume true; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,661 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {39200#(<= ~counter~0 8)} {39200#(<= ~counter~0 8)} #84#return; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,662 INFO L272 TraceCheckUtils]: 123: Hoare triple {39200#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,662 INFO L290 TraceCheckUtils]: 124: Hoare triple {39200#(<= ~counter~0 8)} ~cond := #in~cond; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,662 INFO L290 TraceCheckUtils]: 125: Hoare triple {39200#(<= ~counter~0 8)} assume !(0 == ~cond); {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,663 INFO L290 TraceCheckUtils]: 126: Hoare triple {39200#(<= ~counter~0 8)} assume true; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,663 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {39200#(<= ~counter~0 8)} {39200#(<= ~counter~0 8)} #86#return; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,663 INFO L290 TraceCheckUtils]: 128: Hoare triple {39200#(<= ~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); {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 129: Hoare triple {39200#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39200#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 130: Hoare triple {39200#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39243#(<= |main_#t~post6| 8)} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 131: Hoare triple {39243#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {38840#false} is VALID [2022-04-28 13:27:30,664 INFO L272 TraceCheckUtils]: 132: Hoare triple {38840#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38840#false} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 133: Hoare triple {38840#false} ~cond := #in~cond; {38840#false} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 134: Hoare triple {38840#false} assume 0 == ~cond; {38840#false} is VALID [2022-04-28 13:27:30,664 INFO L290 TraceCheckUtils]: 135: Hoare triple {38840#false} assume !false; {38840#false} is VALID [2022-04-28 13:27:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 716 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 13:27:30,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:31,282 INFO L290 TraceCheckUtils]: 135: Hoare triple {38840#false} assume !false; {38840#false} is VALID [2022-04-28 13:27:31,282 INFO L290 TraceCheckUtils]: 134: Hoare triple {38840#false} assume 0 == ~cond; {38840#false} is VALID [2022-04-28 13:27:31,282 INFO L290 TraceCheckUtils]: 133: Hoare triple {38840#false} ~cond := #in~cond; {38840#false} is VALID [2022-04-28 13:27:31,282 INFO L272 TraceCheckUtils]: 132: Hoare triple {38840#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38840#false} is VALID [2022-04-28 13:27:31,282 INFO L290 TraceCheckUtils]: 131: Hoare triple {39271#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {38840#false} is VALID [2022-04-28 13:27:31,283 INFO L290 TraceCheckUtils]: 130: Hoare triple {39275#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39271#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:27:31,283 INFO L290 TraceCheckUtils]: 129: Hoare triple {39275#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,283 INFO L290 TraceCheckUtils]: 128: Hoare triple {39275#(< ~counter~0 100)} 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); {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,284 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38839#true} {39275#(< ~counter~0 100)} #86#return; {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 126: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 125: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 124: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L272 TraceCheckUtils]: 123: Hoare triple {39275#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38839#true} {39275#(< ~counter~0 100)} #84#return; {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 121: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 120: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,284 INFO L290 TraceCheckUtils]: 119: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,285 INFO L272 TraceCheckUtils]: 118: Hoare triple {39275#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,285 INFO L290 TraceCheckUtils]: 117: Hoare triple {39275#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,286 INFO L290 TraceCheckUtils]: 116: Hoare triple {39318#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39275#(< ~counter~0 100)} is VALID [2022-04-28 13:27:31,286 INFO L290 TraceCheckUtils]: 115: Hoare triple {39318#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,286 INFO L290 TraceCheckUtils]: 114: Hoare triple {39318#(< ~counter~0 99)} 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); {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,287 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38839#true} {39318#(< ~counter~0 99)} #86#return; {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,287 INFO L290 TraceCheckUtils]: 112: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,287 INFO L290 TraceCheckUtils]: 111: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,287 INFO L290 TraceCheckUtils]: 110: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,287 INFO L272 TraceCheckUtils]: 109: Hoare triple {39318#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,287 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38839#true} {39318#(< ~counter~0 99)} #84#return; {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,288 INFO L290 TraceCheckUtils]: 105: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,288 INFO L272 TraceCheckUtils]: 104: Hoare triple {39318#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,288 INFO L290 TraceCheckUtils]: 103: Hoare triple {39318#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,289 INFO L290 TraceCheckUtils]: 102: Hoare triple {39361#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39318#(< ~counter~0 99)} is VALID [2022-04-28 13:27:31,289 INFO L290 TraceCheckUtils]: 101: Hoare triple {39361#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,289 INFO L290 TraceCheckUtils]: 100: Hoare triple {39361#(< ~counter~0 98)} 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); {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,290 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38839#true} {39361#(< ~counter~0 98)} #86#return; {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 98: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 97: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 96: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L272 TraceCheckUtils]: 95: Hoare triple {39361#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38839#true} {39361#(< ~counter~0 98)} #84#return; {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,291 INFO L272 TraceCheckUtils]: 90: Hoare triple {39361#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {39361#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,291 INFO L290 TraceCheckUtils]: 88: Hoare triple {39404#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39361#(< ~counter~0 98)} is VALID [2022-04-28 13:27:31,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {39404#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {39404#(< ~counter~0 97)} 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); {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,292 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38839#true} {39404#(< ~counter~0 97)} #86#return; {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,293 INFO L272 TraceCheckUtils]: 81: Hoare triple {39404#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,293 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38839#true} {39404#(< ~counter~0 97)} #84#return; {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,293 INFO L272 TraceCheckUtils]: 76: Hoare triple {39404#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {39404#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {39447#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39404#(< ~counter~0 97)} is VALID [2022-04-28 13:27:31,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {39447#(< ~counter~0 96)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {39447#(< ~counter~0 96)} 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); {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,295 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38839#true} {39447#(< ~counter~0 96)} #86#return; {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,295 INFO L290 TraceCheckUtils]: 70: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,295 INFO L290 TraceCheckUtils]: 69: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,295 INFO L290 TraceCheckUtils]: 68: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,295 INFO L272 TraceCheckUtils]: 67: Hoare triple {39447#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,296 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38839#true} {39447#(< ~counter~0 96)} #84#return; {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,296 INFO L272 TraceCheckUtils]: 62: Hoare triple {39447#(< ~counter~0 96)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {39447#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {39490#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39447#(< ~counter~0 96)} is VALID [2022-04-28 13:27:31,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {39490#(< ~counter~0 95)} assume !(~r~0 >= ~d~0); {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,298 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38839#true} {39490#(< ~counter~0 95)} #82#return; {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L272 TraceCheckUtils]: 54: Hoare triple {39490#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38839#true} {39490#(< ~counter~0 95)} #80#return; {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,298 INFO L272 TraceCheckUtils]: 49: Hoare triple {39490#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,299 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38839#true} {39490#(< ~counter~0 95)} #78#return; {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,299 INFO L272 TraceCheckUtils]: 44: Hoare triple {39490#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {39490#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {39545#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39490#(< ~counter~0 95)} is VALID [2022-04-28 13:27:31,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {39545#(< ~counter~0 94)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,301 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38839#true} {39545#(< ~counter~0 94)} #82#return; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L272 TraceCheckUtils]: 36: Hoare triple {39545#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38839#true} {39545#(< ~counter~0 94)} #80#return; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L272 TraceCheckUtils]: 31: Hoare triple {39545#(< ~counter~0 94)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38839#true} {39545#(< ~counter~0 94)} #78#return; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L272 TraceCheckUtils]: 26: Hoare triple {39545#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {39545#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {39600#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39545#(< ~counter~0 94)} is VALID [2022-04-28 13:27:31,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {39600#(< ~counter~0 93)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,304 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38839#true} {39600#(< ~counter~0 93)} #82#return; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,304 INFO L272 TraceCheckUtils]: 18: Hoare triple {39600#(< ~counter~0 93)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,304 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38839#true} {39600#(< ~counter~0 93)} #80#return; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L272 TraceCheckUtils]: 13: Hoare triple {39600#(< ~counter~0 93)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38839#true} {39600#(< ~counter~0 93)} #78#return; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {38839#true} assume true; {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {38839#true} assume !(0 == ~cond); {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {38839#true} ~cond := #in~cond; {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L272 TraceCheckUtils]: 8: Hoare triple {39600#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38839#true} is VALID [2022-04-28 13:27:31,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {39600#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {39655#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39600#(< ~counter~0 93)} is VALID [2022-04-28 13:27:31,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {39655#(< ~counter~0 92)} 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; {39655#(< ~counter~0 92)} is VALID [2022-04-28 13:27:31,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {39655#(< ~counter~0 92)} call #t~ret7 := main(); {39655#(< ~counter~0 92)} is VALID [2022-04-28 13:27:31,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39655#(< ~counter~0 92)} {38839#true} #92#return; {39655#(< ~counter~0 92)} is VALID [2022-04-28 13:27:31,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {39655#(< ~counter~0 92)} assume true; {39655#(< ~counter~0 92)} is VALID [2022-04-28 13:27:31,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {38839#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; {39655#(< ~counter~0 92)} is VALID [2022-04-28 13:27:31,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {38839#true} call ULTIMATE.init(); {38839#true} is VALID [2022-04-28 13:27:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 88 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 13:27:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752948025] [2022-04-28 13:27:31,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855539265] [2022-04-28 13:27:31,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855539265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:31,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:31,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 13:27:31,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999952607] [2022-04-28 13:27:31,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999952607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:31,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:31,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:27:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385675588] [2022-04-28 13:27:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 13:27:31,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:31,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:27:31,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:31,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:27:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:31,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:27:31,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 13:27:31,385 INFO L87 Difference]: Start difference. First operand 391 states and 436 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:27:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:32,393 INFO L93 Difference]: Finished difference Result 487 states and 554 transitions. [2022-04-28 13:27:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 13:27:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 13:27:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:32,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-28 13:27:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 13:27:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:27:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 13:27:32,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 193 transitions. [2022-04-28 13:27:32,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:32,577 INFO L225 Difference]: With dead ends: 487 [2022-04-28 13:27:32,577 INFO L226 Difference]: Without dead ends: 474 [2022-04-28 13:27:32,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2022-04-28 13:27:32,584 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:32,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 245 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:27:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-28 13:27:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 473. [2022-04-28 13:27:33,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:33,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 13:27:33,078 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 13:27:33,079 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 13:27:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:33,087 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2022-04-28 13:27:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 533 transitions. [2022-04-28 13:27:33,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:33,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) Second operand 474 states. [2022-04-28 13:27:33,089 INFO L87 Difference]: Start difference. First operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) Second operand 474 states. [2022-04-28 13:27:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:33,102 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2022-04-28 13:27:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 533 transitions. [2022-04-28 13:27:33,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:33,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:33,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:33,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 324 states have (on average 1.1049382716049383) internal successors, (358), 332 states have internal predecessors, (358), 88 states have call successors, (88), 61 states have call predecessors, (88), 60 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2022-04-28 13:27:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 532 transitions. [2022-04-28 13:27:33,130 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 532 transitions. Word has length 136 [2022-04-28 13:27:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:33,130 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 532 transitions. [2022-04-28 13:27:33,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:27:33,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 473 states and 532 transitions. [2022-04-28 13:27:34,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 532 transitions. [2022-04-28 13:27:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-28 13:27:34,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:34,050 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:34,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 13:27:34,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 13:27:34,265 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 13 times [2022-04-28 13:27:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:34,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048813] [2022-04-28 13:27:37,339 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:37,340 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 14 times [2022-04-28 13:27:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811051691] [2022-04-28 13:27:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:37,354 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421815729] [2022-04-28 13:27:37,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:27:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:37,359 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:37,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 13:27:37,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:27:37,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:37,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 13:27:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:37,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:38,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {42554#true} call ULTIMATE.init(); {42554#true} is VALID [2022-04-28 13:27:38,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {42554#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; {42562#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:38,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {42562#(<= ~counter~0 0)} assume true; {42562#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:38,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42562#(<= ~counter~0 0)} {42554#true} #92#return; {42562#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:38,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {42562#(<= ~counter~0 0)} call #t~ret7 := main(); {42562#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:38,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {42562#(<= ~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; {42562#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:38,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {42562#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {42578#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,082 INFO L272 TraceCheckUtils]: 8: Hoare triple {42578#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {42578#(<= ~counter~0 1)} ~cond := #in~cond; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {42578#(<= ~counter~0 1)} assume !(0 == ~cond); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {42578#(<= ~counter~0 1)} assume true; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,083 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42578#(<= ~counter~0 1)} {42578#(<= ~counter~0 1)} #78#return; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,083 INFO L272 TraceCheckUtils]: 13: Hoare triple {42578#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {42578#(<= ~counter~0 1)} ~cond := #in~cond; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {42578#(<= ~counter~0 1)} assume !(0 == ~cond); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {42578#(<= ~counter~0 1)} assume true; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,084 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42578#(<= ~counter~0 1)} {42578#(<= ~counter~0 1)} #80#return; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,084 INFO L272 TraceCheckUtils]: 18: Hoare triple {42578#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {42578#(<= ~counter~0 1)} ~cond := #in~cond; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {42578#(<= ~counter~0 1)} assume !(0 == ~cond); {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {42578#(<= ~counter~0 1)} assume true; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,085 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42578#(<= ~counter~0 1)} {42578#(<= ~counter~0 1)} #82#return; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {42578#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42578#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:38,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {42578#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {42633#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,086 INFO L272 TraceCheckUtils]: 26: Hoare triple {42633#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {42633#(<= ~counter~0 2)} ~cond := #in~cond; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {42633#(<= ~counter~0 2)} assume !(0 == ~cond); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {42633#(<= ~counter~0 2)} assume true; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,087 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42633#(<= ~counter~0 2)} {42633#(<= ~counter~0 2)} #78#return; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,088 INFO L272 TraceCheckUtils]: 31: Hoare triple {42633#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {42633#(<= ~counter~0 2)} ~cond := #in~cond; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {42633#(<= ~counter~0 2)} assume !(0 == ~cond); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {42633#(<= ~counter~0 2)} assume true; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,088 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42633#(<= ~counter~0 2)} {42633#(<= ~counter~0 2)} #80#return; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,089 INFO L272 TraceCheckUtils]: 36: Hoare triple {42633#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {42633#(<= ~counter~0 2)} ~cond := #in~cond; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {42633#(<= ~counter~0 2)} assume !(0 == ~cond); {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {42633#(<= ~counter~0 2)} assume true; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,090 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42633#(<= ~counter~0 2)} {42633#(<= ~counter~0 2)} #82#return; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {42633#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42633#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:38,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {42633#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {42688#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,091 INFO L272 TraceCheckUtils]: 44: Hoare triple {42688#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {42688#(<= ~counter~0 3)} ~cond := #in~cond; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {42688#(<= ~counter~0 3)} assume !(0 == ~cond); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {42688#(<= ~counter~0 3)} assume true; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,092 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42688#(<= ~counter~0 3)} {42688#(<= ~counter~0 3)} #78#return; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,092 INFO L272 TraceCheckUtils]: 49: Hoare triple {42688#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {42688#(<= ~counter~0 3)} ~cond := #in~cond; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {42688#(<= ~counter~0 3)} assume !(0 == ~cond); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {42688#(<= ~counter~0 3)} assume true; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,093 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42688#(<= ~counter~0 3)} {42688#(<= ~counter~0 3)} #80#return; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,093 INFO L272 TraceCheckUtils]: 54: Hoare triple {42688#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {42688#(<= ~counter~0 3)} ~cond := #in~cond; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {42688#(<= ~counter~0 3)} assume !(0 == ~cond); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {42688#(<= ~counter~0 3)} assume true; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,094 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42688#(<= ~counter~0 3)} {42688#(<= ~counter~0 3)} #82#return; {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {42688#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {42688#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:38,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {42688#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {42743#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,096 INFO L272 TraceCheckUtils]: 62: Hoare triple {42743#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {42743#(<= ~counter~0 4)} ~cond := #in~cond; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {42743#(<= ~counter~0 4)} assume !(0 == ~cond); {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {42743#(<= ~counter~0 4)} assume true; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,097 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42743#(<= ~counter~0 4)} {42743#(<= ~counter~0 4)} #84#return; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,097 INFO L272 TraceCheckUtils]: 67: Hoare triple {42743#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {42743#(<= ~counter~0 4)} ~cond := #in~cond; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {42743#(<= ~counter~0 4)} assume !(0 == ~cond); {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {42743#(<= ~counter~0 4)} assume true; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,098 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42743#(<= ~counter~0 4)} {42743#(<= ~counter~0 4)} #86#return; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {42743#(<= ~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); {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {42743#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42743#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:38,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {42743#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {42786#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,099 INFO L272 TraceCheckUtils]: 76: Hoare triple {42786#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {42786#(<= ~counter~0 5)} ~cond := #in~cond; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {42786#(<= ~counter~0 5)} assume !(0 == ~cond); {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {42786#(<= ~counter~0 5)} assume true; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,100 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42786#(<= ~counter~0 5)} {42786#(<= ~counter~0 5)} #84#return; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,101 INFO L272 TraceCheckUtils]: 81: Hoare triple {42786#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {42786#(<= ~counter~0 5)} ~cond := #in~cond; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {42786#(<= ~counter~0 5)} assume !(0 == ~cond); {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {42786#(<= ~counter~0 5)} assume true; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,102 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42786#(<= ~counter~0 5)} {42786#(<= ~counter~0 5)} #86#return; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {42786#(<= ~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); {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,102 INFO L290 TraceCheckUtils]: 87: Hoare triple {42786#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42786#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:38,103 INFO L290 TraceCheckUtils]: 88: Hoare triple {42786#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,103 INFO L290 TraceCheckUtils]: 89: Hoare triple {42829#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,103 INFO L272 TraceCheckUtils]: 90: Hoare triple {42829#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,103 INFO L290 TraceCheckUtils]: 91: Hoare triple {42829#(<= ~counter~0 6)} ~cond := #in~cond; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {42829#(<= ~counter~0 6)} assume !(0 == ~cond); {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,104 INFO L290 TraceCheckUtils]: 93: Hoare triple {42829#(<= ~counter~0 6)} assume true; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,104 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42829#(<= ~counter~0 6)} {42829#(<= ~counter~0 6)} #84#return; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,104 INFO L272 TraceCheckUtils]: 95: Hoare triple {42829#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {42829#(<= ~counter~0 6)} ~cond := #in~cond; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {42829#(<= ~counter~0 6)} assume !(0 == ~cond); {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {42829#(<= ~counter~0 6)} assume true; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,105 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42829#(<= ~counter~0 6)} {42829#(<= ~counter~0 6)} #86#return; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,106 INFO L290 TraceCheckUtils]: 100: Hoare triple {42829#(<= ~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); {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,106 INFO L290 TraceCheckUtils]: 101: Hoare triple {42829#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42829#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:38,106 INFO L290 TraceCheckUtils]: 102: Hoare triple {42829#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,106 INFO L290 TraceCheckUtils]: 103: Hoare triple {42872#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,107 INFO L272 TraceCheckUtils]: 104: Hoare triple {42872#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,107 INFO L290 TraceCheckUtils]: 105: Hoare triple {42872#(<= ~counter~0 7)} ~cond := #in~cond; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,107 INFO L290 TraceCheckUtils]: 106: Hoare triple {42872#(<= ~counter~0 7)} assume !(0 == ~cond); {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,107 INFO L290 TraceCheckUtils]: 107: Hoare triple {42872#(<= ~counter~0 7)} assume true; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,108 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42872#(<= ~counter~0 7)} {42872#(<= ~counter~0 7)} #84#return; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,108 INFO L272 TraceCheckUtils]: 109: Hoare triple {42872#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,108 INFO L290 TraceCheckUtils]: 110: Hoare triple {42872#(<= ~counter~0 7)} ~cond := #in~cond; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,109 INFO L290 TraceCheckUtils]: 111: Hoare triple {42872#(<= ~counter~0 7)} assume !(0 == ~cond); {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,109 INFO L290 TraceCheckUtils]: 112: Hoare triple {42872#(<= ~counter~0 7)} assume true; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,109 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42872#(<= ~counter~0 7)} {42872#(<= ~counter~0 7)} #86#return; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,109 INFO L290 TraceCheckUtils]: 114: Hoare triple {42872#(<= ~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); {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,109 INFO L290 TraceCheckUtils]: 115: Hoare triple {42872#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42872#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:38,110 INFO L290 TraceCheckUtils]: 116: Hoare triple {42872#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,110 INFO L290 TraceCheckUtils]: 117: Hoare triple {42915#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,111 INFO L272 TraceCheckUtils]: 118: Hoare triple {42915#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,111 INFO L290 TraceCheckUtils]: 119: Hoare triple {42915#(<= ~counter~0 8)} ~cond := #in~cond; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,111 INFO L290 TraceCheckUtils]: 120: Hoare triple {42915#(<= ~counter~0 8)} assume !(0 == ~cond); {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,111 INFO L290 TraceCheckUtils]: 121: Hoare triple {42915#(<= ~counter~0 8)} assume true; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,112 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42915#(<= ~counter~0 8)} {42915#(<= ~counter~0 8)} #84#return; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,112 INFO L272 TraceCheckUtils]: 123: Hoare triple {42915#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,112 INFO L290 TraceCheckUtils]: 124: Hoare triple {42915#(<= ~counter~0 8)} ~cond := #in~cond; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,112 INFO L290 TraceCheckUtils]: 125: Hoare triple {42915#(<= ~counter~0 8)} assume !(0 == ~cond); {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,112 INFO L290 TraceCheckUtils]: 126: Hoare triple {42915#(<= ~counter~0 8)} assume true; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,113 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42915#(<= ~counter~0 8)} {42915#(<= ~counter~0 8)} #86#return; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,113 INFO L290 TraceCheckUtils]: 128: Hoare triple {42915#(<= ~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); {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,113 INFO L290 TraceCheckUtils]: 129: Hoare triple {42915#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42915#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:38,114 INFO L290 TraceCheckUtils]: 130: Hoare triple {42915#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,114 INFO L290 TraceCheckUtils]: 131: Hoare triple {42958#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,114 INFO L272 TraceCheckUtils]: 132: Hoare triple {42958#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,114 INFO L290 TraceCheckUtils]: 133: Hoare triple {42958#(<= ~counter~0 9)} ~cond := #in~cond; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,115 INFO L290 TraceCheckUtils]: 134: Hoare triple {42958#(<= ~counter~0 9)} assume !(0 == ~cond); {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,115 INFO L290 TraceCheckUtils]: 135: Hoare triple {42958#(<= ~counter~0 9)} assume true; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,115 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42958#(<= ~counter~0 9)} {42958#(<= ~counter~0 9)} #84#return; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,116 INFO L272 TraceCheckUtils]: 137: Hoare triple {42958#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,116 INFO L290 TraceCheckUtils]: 138: Hoare triple {42958#(<= ~counter~0 9)} ~cond := #in~cond; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,116 INFO L290 TraceCheckUtils]: 139: Hoare triple {42958#(<= ~counter~0 9)} assume !(0 == ~cond); {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,116 INFO L290 TraceCheckUtils]: 140: Hoare triple {42958#(<= ~counter~0 9)} assume true; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,116 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42958#(<= ~counter~0 9)} {42958#(<= ~counter~0 9)} #86#return; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,117 INFO L290 TraceCheckUtils]: 142: Hoare triple {42958#(<= ~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); {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,117 INFO L290 TraceCheckUtils]: 143: Hoare triple {42958#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42958#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:38,117 INFO L290 TraceCheckUtils]: 144: Hoare triple {42958#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43001#(<= |main_#t~post6| 9)} is VALID [2022-04-28 13:27:38,117 INFO L290 TraceCheckUtils]: 145: Hoare triple {43001#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {42555#false} is VALID [2022-04-28 13:27:38,118 INFO L272 TraceCheckUtils]: 146: Hoare triple {42555#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42555#false} is VALID [2022-04-28 13:27:38,118 INFO L290 TraceCheckUtils]: 147: Hoare triple {42555#false} ~cond := #in~cond; {42555#false} is VALID [2022-04-28 13:27:38,118 INFO L290 TraceCheckUtils]: 148: Hoare triple {42555#false} assume 0 == ~cond; {42555#false} is VALID [2022-04-28 13:27:38,118 INFO L290 TraceCheckUtils]: 149: Hoare triple {42555#false} assume !false; {42555#false} is VALID [2022-04-28 13:27:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 900 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 13:27:38,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:38,626 INFO L290 TraceCheckUtils]: 149: Hoare triple {42555#false} assume !false; {42555#false} is VALID [2022-04-28 13:27:38,626 INFO L290 TraceCheckUtils]: 148: Hoare triple {42555#false} assume 0 == ~cond; {42555#false} is VALID [2022-04-28 13:27:38,626 INFO L290 TraceCheckUtils]: 147: Hoare triple {42555#false} ~cond := #in~cond; {42555#false} is VALID [2022-04-28 13:27:38,626 INFO L272 TraceCheckUtils]: 146: Hoare triple {42555#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42555#false} is VALID [2022-04-28 13:27:38,627 INFO L290 TraceCheckUtils]: 145: Hoare triple {43029#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {42555#false} is VALID [2022-04-28 13:27:38,627 INFO L290 TraceCheckUtils]: 144: Hoare triple {43033#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43029#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:27:38,627 INFO L290 TraceCheckUtils]: 143: Hoare triple {43033#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,627 INFO L290 TraceCheckUtils]: 142: Hoare triple {43033#(< ~counter~0 100)} 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); {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,628 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42554#true} {43033#(< ~counter~0 100)} #86#return; {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 140: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 139: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L272 TraceCheckUtils]: 137: Hoare triple {43033#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42554#true} {43033#(< ~counter~0 100)} #84#return; {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 135: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 134: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L290 TraceCheckUtils]: 133: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,628 INFO L272 TraceCheckUtils]: 132: Hoare triple {43033#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,643 INFO L290 TraceCheckUtils]: 131: Hoare triple {43033#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,644 INFO L290 TraceCheckUtils]: 130: Hoare triple {43076#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43033#(< ~counter~0 100)} is VALID [2022-04-28 13:27:38,644 INFO L290 TraceCheckUtils]: 129: Hoare triple {43076#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,645 INFO L290 TraceCheckUtils]: 128: Hoare triple {43076#(< ~counter~0 99)} 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); {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,645 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42554#true} {43076#(< ~counter~0 99)} #86#return; {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,645 INFO L290 TraceCheckUtils]: 126: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,645 INFO L290 TraceCheckUtils]: 125: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,645 INFO L290 TraceCheckUtils]: 124: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,645 INFO L272 TraceCheckUtils]: 123: Hoare triple {43076#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,646 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42554#true} {43076#(< ~counter~0 99)} #84#return; {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,646 INFO L290 TraceCheckUtils]: 121: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,646 INFO L290 TraceCheckUtils]: 120: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,646 INFO L290 TraceCheckUtils]: 119: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,646 INFO L272 TraceCheckUtils]: 118: Hoare triple {43076#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,646 INFO L290 TraceCheckUtils]: 117: Hoare triple {43076#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,647 INFO L290 TraceCheckUtils]: 116: Hoare triple {43119#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43076#(< ~counter~0 99)} is VALID [2022-04-28 13:27:38,647 INFO L290 TraceCheckUtils]: 115: Hoare triple {43119#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,647 INFO L290 TraceCheckUtils]: 114: Hoare triple {43119#(< ~counter~0 98)} 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); {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,647 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42554#true} {43119#(< ~counter~0 98)} #86#return; {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 112: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 111: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 110: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L272 TraceCheckUtils]: 109: Hoare triple {43119#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42554#true} {43119#(< ~counter~0 98)} #84#return; {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 107: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L290 TraceCheckUtils]: 105: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,648 INFO L272 TraceCheckUtils]: 104: Hoare triple {43119#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,649 INFO L290 TraceCheckUtils]: 103: Hoare triple {43119#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,649 INFO L290 TraceCheckUtils]: 102: Hoare triple {43162#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43119#(< ~counter~0 98)} is VALID [2022-04-28 13:27:38,649 INFO L290 TraceCheckUtils]: 101: Hoare triple {43162#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,650 INFO L290 TraceCheckUtils]: 100: Hoare triple {43162#(< ~counter~0 97)} 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); {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,650 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42554#true} {43162#(< ~counter~0 97)} #86#return; {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,650 INFO L290 TraceCheckUtils]: 98: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,650 INFO L290 TraceCheckUtils]: 97: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,650 INFO L290 TraceCheckUtils]: 96: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,650 INFO L272 TraceCheckUtils]: 95: Hoare triple {43162#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,651 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42554#true} {43162#(< ~counter~0 97)} #84#return; {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,651 INFO L290 TraceCheckUtils]: 93: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,651 INFO L290 TraceCheckUtils]: 91: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,651 INFO L272 TraceCheckUtils]: 90: Hoare triple {43162#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,651 INFO L290 TraceCheckUtils]: 89: Hoare triple {43162#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {43205#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43162#(< ~counter~0 97)} is VALID [2022-04-28 13:27:38,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {43205#(< ~counter~0 96)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,652 INFO L290 TraceCheckUtils]: 86: Hoare triple {43205#(< ~counter~0 96)} 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); {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,652 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42554#true} {43205#(< ~counter~0 96)} #86#return; {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L272 TraceCheckUtils]: 81: Hoare triple {43205#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42554#true} {43205#(< ~counter~0 96)} #84#return; {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L290 TraceCheckUtils]: 78: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L272 TraceCheckUtils]: 76: Hoare triple {43205#(< ~counter~0 96)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {43205#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {43248#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43205#(< ~counter~0 96)} is VALID [2022-04-28 13:27:38,654 INFO L290 TraceCheckUtils]: 73: Hoare triple {43248#(< ~counter~0 95)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {43248#(< ~counter~0 95)} 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); {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,655 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42554#true} {43248#(< ~counter~0 95)} #86#return; {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,655 INFO L290 TraceCheckUtils]: 70: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,655 INFO L290 TraceCheckUtils]: 69: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,655 INFO L290 TraceCheckUtils]: 68: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,655 INFO L272 TraceCheckUtils]: 67: Hoare triple {43248#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,655 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42554#true} {43248#(< ~counter~0 95)} #84#return; {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,655 INFO L290 TraceCheckUtils]: 65: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,656 INFO L272 TraceCheckUtils]: 62: Hoare triple {43248#(< ~counter~0 95)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {43248#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {43291#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43248#(< ~counter~0 95)} is VALID [2022-04-28 13:27:38,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {43291#(< ~counter~0 94)} assume !(~r~0 >= ~d~0); {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,657 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42554#true} {43291#(< ~counter~0 94)} #82#return; {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,657 INFO L272 TraceCheckUtils]: 54: Hoare triple {43291#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,658 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42554#true} {43291#(< ~counter~0 94)} #80#return; {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,670 INFO L272 TraceCheckUtils]: 49: Hoare triple {43291#(< ~counter~0 94)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,671 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42554#true} {43291#(< ~counter~0 94)} #78#return; {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,671 INFO L272 TraceCheckUtils]: 44: Hoare triple {43291#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {43291#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {43346#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43291#(< ~counter~0 94)} is VALID [2022-04-28 13:27:38,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {43346#(< ~counter~0 93)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,673 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42554#true} {43346#(< ~counter~0 93)} #82#return; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,673 INFO L272 TraceCheckUtils]: 36: Hoare triple {43346#(< ~counter~0 93)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42554#true} {43346#(< ~counter~0 93)} #80#return; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L272 TraceCheckUtils]: 31: Hoare triple {43346#(< ~counter~0 93)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42554#true} {43346#(< ~counter~0 93)} #78#return; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,674 INFO L272 TraceCheckUtils]: 26: Hoare triple {43346#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {43346#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {43401#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43346#(< ~counter~0 93)} is VALID [2022-04-28 13:27:38,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {43401#(< ~counter~0 92)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,676 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42554#true} {43401#(< ~counter~0 92)} #82#return; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,676 INFO L272 TraceCheckUtils]: 18: Hoare triple {43401#(< ~counter~0 92)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,676 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42554#true} {43401#(< ~counter~0 92)} #80#return; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L272 TraceCheckUtils]: 13: Hoare triple {43401#(< ~counter~0 92)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42554#true} {43401#(< ~counter~0 92)} #78#return; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {42554#true} assume true; {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {42554#true} assume !(0 == ~cond); {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {42554#true} ~cond := #in~cond; {42554#true} is VALID [2022-04-28 13:27:38,677 INFO L272 TraceCheckUtils]: 8: Hoare triple {43401#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42554#true} is VALID [2022-04-28 13:27:38,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {43401#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {43456#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43401#(< ~counter~0 92)} is VALID [2022-04-28 13:27:38,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {43456#(< ~counter~0 91)} 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; {43456#(< ~counter~0 91)} is VALID [2022-04-28 13:27:38,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {43456#(< ~counter~0 91)} call #t~ret7 := main(); {43456#(< ~counter~0 91)} is VALID [2022-04-28 13:27:38,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43456#(< ~counter~0 91)} {42554#true} #92#return; {43456#(< ~counter~0 91)} is VALID [2022-04-28 13:27:38,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {43456#(< ~counter~0 91)} assume true; {43456#(< ~counter~0 91)} is VALID [2022-04-28 13:27:38,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {42554#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; {43456#(< ~counter~0 91)} is VALID [2022-04-28 13:27:38,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {42554#true} call ULTIMATE.init(); {42554#true} is VALID [2022-04-28 13:27:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 13:27:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811051691] [2022-04-28 13:27:38,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421815729] [2022-04-28 13:27:38,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421815729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:38,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:38,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 13:27:38,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048813] [2022-04-28 13:27:38,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:38,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:38,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:27:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296177762] [2022-04-28 13:27:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 13:27:38,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:38,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:27:38,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:38,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:27:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:38,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:27:38,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:27:38,768 INFO L87 Difference]: Start difference. First operand 473 states and 532 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:27:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:40,032 INFO L93 Difference]: Finished difference Result 579 states and 663 transitions. [2022-04-28 13:27:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 13:27:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 13:27:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:27:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 13:27:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:27:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 13:27:40,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 216 transitions. [2022-04-28 13:27:40,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:40,192 INFO L225 Difference]: With dead ends: 579 [2022-04-28 13:27:40,192 INFO L226 Difference]: Without dead ends: 566 [2022-04-28 13:27:40,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=356, Invalid=514, Unknown=0, NotChecked=0, Total=870 [2022-04-28 13:27:40,192 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:40,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 247 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:27:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-04-28 13:27:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2022-04-28 13:27:41,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:41,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 13:27:41,141 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 13:27:41,142 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 13:27:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:41,152 INFO L93 Difference]: Finished difference Result 566 states and 641 transitions. [2022-04-28 13:27:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 641 transitions. [2022-04-28 13:27:41,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:41,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:41,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) Second operand 566 states. [2022-04-28 13:27:41,154 INFO L87 Difference]: Start difference. First operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) Second operand 566 states. [2022-04-28 13:27:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:41,164 INFO L93 Difference]: Finished difference Result 566 states and 641 transitions. [2022-04-28 13:27:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 641 transitions. [2022-04-28 13:27:41,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:41,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:41,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:41,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 387 states have (on average 1.1059431524547803) internal successors, (428), 397 states have internal predecessors, (428), 107 states have call successors, (107), 71 states have call predecessors, (107), 70 states have return successors, (105), 96 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-28 13:27:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 640 transitions. [2022-04-28 13:27:41,180 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 640 transitions. Word has length 150 [2022-04-28 13:27:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:41,180 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 640 transitions. [2022-04-28 13:27:41,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:27:41,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 565 states and 640 transitions. [2022-04-28 13:27:42,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 640 transitions. [2022-04-28 13:27:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 13:27:42,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:42,336 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 8, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:27:42,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 13:27:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:42,536 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 15 times [2022-04-28 13:27:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:42,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943166207] [2022-04-28 13:27:46,629 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:27:46,630 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:27:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 16 times [2022-04-28 13:27:46,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:27:46,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693998480] [2022-04-28 13:27:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:27:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:27:46,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:27:46,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404925285] [2022-04-28 13:27:46,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:27:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:27:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:27:46,647 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:27:46,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 13:27:53,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:27:53,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:27:53,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 13:27:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:27:53,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:27:54,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {46909#true} call ULTIMATE.init(); {46909#true} is VALID [2022-04-28 13:27:54,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {46909#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; {46917#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:54,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {46917#(<= ~counter~0 0)} assume true; {46917#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:54,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46917#(<= ~counter~0 0)} {46909#true} #92#return; {46917#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:54,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {46917#(<= ~counter~0 0)} call #t~ret7 := main(); {46917#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:54,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {46917#(<= ~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; {46917#(<= ~counter~0 0)} is VALID [2022-04-28 13:27:54,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {46917#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {46933#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,164 INFO L272 TraceCheckUtils]: 8: Hoare triple {46933#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {46933#(<= ~counter~0 1)} ~cond := #in~cond; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {46933#(<= ~counter~0 1)} assume !(0 == ~cond); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {46933#(<= ~counter~0 1)} assume true; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,165 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46933#(<= ~counter~0 1)} {46933#(<= ~counter~0 1)} #78#return; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,165 INFO L272 TraceCheckUtils]: 13: Hoare triple {46933#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {46933#(<= ~counter~0 1)} ~cond := #in~cond; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {46933#(<= ~counter~0 1)} assume !(0 == ~cond); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {46933#(<= ~counter~0 1)} assume true; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,166 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46933#(<= ~counter~0 1)} {46933#(<= ~counter~0 1)} #80#return; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,167 INFO L272 TraceCheckUtils]: 18: Hoare triple {46933#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {46933#(<= ~counter~0 1)} ~cond := #in~cond; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {46933#(<= ~counter~0 1)} assume !(0 == ~cond); {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {46933#(<= ~counter~0 1)} assume true; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,168 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46933#(<= ~counter~0 1)} {46933#(<= ~counter~0 1)} #82#return; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {46933#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46933#(<= ~counter~0 1)} is VALID [2022-04-28 13:27:54,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {46933#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {46988#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,169 INFO L272 TraceCheckUtils]: 26: Hoare triple {46988#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {46988#(<= ~counter~0 2)} ~cond := #in~cond; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {46988#(<= ~counter~0 2)} assume !(0 == ~cond); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {46988#(<= ~counter~0 2)} assume true; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,170 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46988#(<= ~counter~0 2)} {46988#(<= ~counter~0 2)} #78#return; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,171 INFO L272 TraceCheckUtils]: 31: Hoare triple {46988#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {46988#(<= ~counter~0 2)} ~cond := #in~cond; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {46988#(<= ~counter~0 2)} assume !(0 == ~cond); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {46988#(<= ~counter~0 2)} assume true; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,172 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46988#(<= ~counter~0 2)} {46988#(<= ~counter~0 2)} #80#return; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,172 INFO L272 TraceCheckUtils]: 36: Hoare triple {46988#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {46988#(<= ~counter~0 2)} ~cond := #in~cond; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {46988#(<= ~counter~0 2)} assume !(0 == ~cond); {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {46988#(<= ~counter~0 2)} assume true; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,173 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46988#(<= ~counter~0 2)} {46988#(<= ~counter~0 2)} #82#return; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {46988#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46988#(<= ~counter~0 2)} is VALID [2022-04-28 13:27:54,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {46988#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {47043#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,175 INFO L272 TraceCheckUtils]: 44: Hoare triple {47043#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {47043#(<= ~counter~0 3)} ~cond := #in~cond; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {47043#(<= ~counter~0 3)} assume !(0 == ~cond); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,175 INFO L290 TraceCheckUtils]: 47: Hoare triple {47043#(<= ~counter~0 3)} assume true; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,176 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47043#(<= ~counter~0 3)} {47043#(<= ~counter~0 3)} #78#return; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,176 INFO L272 TraceCheckUtils]: 49: Hoare triple {47043#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,176 INFO L290 TraceCheckUtils]: 50: Hoare triple {47043#(<= ~counter~0 3)} ~cond := #in~cond; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {47043#(<= ~counter~0 3)} assume !(0 == ~cond); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {47043#(<= ~counter~0 3)} assume true; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,177 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47043#(<= ~counter~0 3)} {47043#(<= ~counter~0 3)} #80#return; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,178 INFO L272 TraceCheckUtils]: 54: Hoare triple {47043#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {47043#(<= ~counter~0 3)} ~cond := #in~cond; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {47043#(<= ~counter~0 3)} assume !(0 == ~cond); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {47043#(<= ~counter~0 3)} assume true; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,179 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47043#(<= ~counter~0 3)} {47043#(<= ~counter~0 3)} #82#return; {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {47043#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {47043#(<= ~counter~0 3)} is VALID [2022-04-28 13:27:54,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {47043#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,180 INFO L290 TraceCheckUtils]: 61: Hoare triple {47098#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,180 INFO L272 TraceCheckUtils]: 62: Hoare triple {47098#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {47098#(<= ~counter~0 4)} ~cond := #in~cond; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {47098#(<= ~counter~0 4)} assume !(0 == ~cond); {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {47098#(<= ~counter~0 4)} assume true; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,181 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47098#(<= ~counter~0 4)} {47098#(<= ~counter~0 4)} #84#return; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,182 INFO L272 TraceCheckUtils]: 67: Hoare triple {47098#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {47098#(<= ~counter~0 4)} ~cond := #in~cond; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,182 INFO L290 TraceCheckUtils]: 69: Hoare triple {47098#(<= ~counter~0 4)} assume !(0 == ~cond); {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {47098#(<= ~counter~0 4)} assume true; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,183 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47098#(<= ~counter~0 4)} {47098#(<= ~counter~0 4)} #86#return; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {47098#(<= ~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); {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {47098#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47098#(<= ~counter~0 4)} is VALID [2022-04-28 13:27:54,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {47098#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {47141#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,185 INFO L272 TraceCheckUtils]: 76: Hoare triple {47141#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {47141#(<= ~counter~0 5)} ~cond := #in~cond; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {47141#(<= ~counter~0 5)} assume !(0 == ~cond); {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {47141#(<= ~counter~0 5)} assume true; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,186 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47141#(<= ~counter~0 5)} {47141#(<= ~counter~0 5)} #84#return; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,186 INFO L272 TraceCheckUtils]: 81: Hoare triple {47141#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,186 INFO L290 TraceCheckUtils]: 82: Hoare triple {47141#(<= ~counter~0 5)} ~cond := #in~cond; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,187 INFO L290 TraceCheckUtils]: 83: Hoare triple {47141#(<= ~counter~0 5)} assume !(0 == ~cond); {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,187 INFO L290 TraceCheckUtils]: 84: Hoare triple {47141#(<= ~counter~0 5)} assume true; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,187 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47141#(<= ~counter~0 5)} {47141#(<= ~counter~0 5)} #86#return; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,187 INFO L290 TraceCheckUtils]: 86: Hoare triple {47141#(<= ~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); {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,188 INFO L290 TraceCheckUtils]: 87: Hoare triple {47141#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47141#(<= ~counter~0 5)} is VALID [2022-04-28 13:27:54,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {47141#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,189 INFO L290 TraceCheckUtils]: 89: Hoare triple {47184#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,189 INFO L272 TraceCheckUtils]: 90: Hoare triple {47184#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {47184#(<= ~counter~0 6)} ~cond := #in~cond; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {47184#(<= ~counter~0 6)} assume !(0 == ~cond); {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,190 INFO L290 TraceCheckUtils]: 93: Hoare triple {47184#(<= ~counter~0 6)} assume true; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,190 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47184#(<= ~counter~0 6)} {47184#(<= ~counter~0 6)} #84#return; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,190 INFO L272 TraceCheckUtils]: 95: Hoare triple {47184#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,191 INFO L290 TraceCheckUtils]: 96: Hoare triple {47184#(<= ~counter~0 6)} ~cond := #in~cond; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,191 INFO L290 TraceCheckUtils]: 97: Hoare triple {47184#(<= ~counter~0 6)} assume !(0 == ~cond); {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,191 INFO L290 TraceCheckUtils]: 98: Hoare triple {47184#(<= ~counter~0 6)} assume true; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,192 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47184#(<= ~counter~0 6)} {47184#(<= ~counter~0 6)} #86#return; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {47184#(<= ~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); {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {47184#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47184#(<= ~counter~0 6)} is VALID [2022-04-28 13:27:54,193 INFO L290 TraceCheckUtils]: 102: Hoare triple {47184#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,193 INFO L290 TraceCheckUtils]: 103: Hoare triple {47227#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,193 INFO L272 TraceCheckUtils]: 104: Hoare triple {47227#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,194 INFO L290 TraceCheckUtils]: 105: Hoare triple {47227#(<= ~counter~0 7)} ~cond := #in~cond; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,194 INFO L290 TraceCheckUtils]: 106: Hoare triple {47227#(<= ~counter~0 7)} assume !(0 == ~cond); {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,194 INFO L290 TraceCheckUtils]: 107: Hoare triple {47227#(<= ~counter~0 7)} assume true; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,194 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47227#(<= ~counter~0 7)} {47227#(<= ~counter~0 7)} #84#return; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,195 INFO L272 TraceCheckUtils]: 109: Hoare triple {47227#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {47227#(<= ~counter~0 7)} ~cond := #in~cond; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,195 INFO L290 TraceCheckUtils]: 111: Hoare triple {47227#(<= ~counter~0 7)} assume !(0 == ~cond); {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,196 INFO L290 TraceCheckUtils]: 112: Hoare triple {47227#(<= ~counter~0 7)} assume true; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,196 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47227#(<= ~counter~0 7)} {47227#(<= ~counter~0 7)} #86#return; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,196 INFO L290 TraceCheckUtils]: 114: Hoare triple {47227#(<= ~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); {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,196 INFO L290 TraceCheckUtils]: 115: Hoare triple {47227#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47227#(<= ~counter~0 7)} is VALID [2022-04-28 13:27:54,197 INFO L290 TraceCheckUtils]: 116: Hoare triple {47227#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,197 INFO L290 TraceCheckUtils]: 117: Hoare triple {47270#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,198 INFO L272 TraceCheckUtils]: 118: Hoare triple {47270#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,198 INFO L290 TraceCheckUtils]: 119: Hoare triple {47270#(<= ~counter~0 8)} ~cond := #in~cond; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,198 INFO L290 TraceCheckUtils]: 120: Hoare triple {47270#(<= ~counter~0 8)} assume !(0 == ~cond); {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,198 INFO L290 TraceCheckUtils]: 121: Hoare triple {47270#(<= ~counter~0 8)} assume true; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,199 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47270#(<= ~counter~0 8)} {47270#(<= ~counter~0 8)} #84#return; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,199 INFO L272 TraceCheckUtils]: 123: Hoare triple {47270#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,199 INFO L290 TraceCheckUtils]: 124: Hoare triple {47270#(<= ~counter~0 8)} ~cond := #in~cond; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,200 INFO L290 TraceCheckUtils]: 125: Hoare triple {47270#(<= ~counter~0 8)} assume !(0 == ~cond); {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,200 INFO L290 TraceCheckUtils]: 126: Hoare triple {47270#(<= ~counter~0 8)} assume true; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,200 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47270#(<= ~counter~0 8)} {47270#(<= ~counter~0 8)} #86#return; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,201 INFO L290 TraceCheckUtils]: 128: Hoare triple {47270#(<= ~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); {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,201 INFO L290 TraceCheckUtils]: 129: Hoare triple {47270#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47270#(<= ~counter~0 8)} is VALID [2022-04-28 13:27:54,201 INFO L290 TraceCheckUtils]: 130: Hoare triple {47270#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,202 INFO L290 TraceCheckUtils]: 131: Hoare triple {47313#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,202 INFO L272 TraceCheckUtils]: 132: Hoare triple {47313#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,202 INFO L290 TraceCheckUtils]: 133: Hoare triple {47313#(<= ~counter~0 9)} ~cond := #in~cond; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,203 INFO L290 TraceCheckUtils]: 134: Hoare triple {47313#(<= ~counter~0 9)} assume !(0 == ~cond); {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,203 INFO L290 TraceCheckUtils]: 135: Hoare triple {47313#(<= ~counter~0 9)} assume true; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,203 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47313#(<= ~counter~0 9)} {47313#(<= ~counter~0 9)} #84#return; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,204 INFO L272 TraceCheckUtils]: 137: Hoare triple {47313#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,204 INFO L290 TraceCheckUtils]: 138: Hoare triple {47313#(<= ~counter~0 9)} ~cond := #in~cond; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,204 INFO L290 TraceCheckUtils]: 139: Hoare triple {47313#(<= ~counter~0 9)} assume !(0 == ~cond); {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,204 INFO L290 TraceCheckUtils]: 140: Hoare triple {47313#(<= ~counter~0 9)} assume true; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,205 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47313#(<= ~counter~0 9)} {47313#(<= ~counter~0 9)} #86#return; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,205 INFO L290 TraceCheckUtils]: 142: Hoare triple {47313#(<= ~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); {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,205 INFO L290 TraceCheckUtils]: 143: Hoare triple {47313#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47313#(<= ~counter~0 9)} is VALID [2022-04-28 13:27:54,206 INFO L290 TraceCheckUtils]: 144: Hoare triple {47313#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,206 INFO L290 TraceCheckUtils]: 145: Hoare triple {47356#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,206 INFO L272 TraceCheckUtils]: 146: Hoare triple {47356#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,207 INFO L290 TraceCheckUtils]: 147: Hoare triple {47356#(<= ~counter~0 10)} ~cond := #in~cond; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,207 INFO L290 TraceCheckUtils]: 148: Hoare triple {47356#(<= ~counter~0 10)} assume !(0 == ~cond); {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,207 INFO L290 TraceCheckUtils]: 149: Hoare triple {47356#(<= ~counter~0 10)} assume true; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,208 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47356#(<= ~counter~0 10)} {47356#(<= ~counter~0 10)} #84#return; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,208 INFO L272 TraceCheckUtils]: 151: Hoare triple {47356#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,208 INFO L290 TraceCheckUtils]: 152: Hoare triple {47356#(<= ~counter~0 10)} ~cond := #in~cond; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,209 INFO L290 TraceCheckUtils]: 153: Hoare triple {47356#(<= ~counter~0 10)} assume !(0 == ~cond); {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,209 INFO L290 TraceCheckUtils]: 154: Hoare triple {47356#(<= ~counter~0 10)} assume true; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,209 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47356#(<= ~counter~0 10)} {47356#(<= ~counter~0 10)} #86#return; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,209 INFO L290 TraceCheckUtils]: 156: Hoare triple {47356#(<= ~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); {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,210 INFO L290 TraceCheckUtils]: 157: Hoare triple {47356#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47356#(<= ~counter~0 10)} is VALID [2022-04-28 13:27:54,210 INFO L290 TraceCheckUtils]: 158: Hoare triple {47356#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47399#(<= |main_#t~post6| 10)} is VALID [2022-04-28 13:27:54,210 INFO L290 TraceCheckUtils]: 159: Hoare triple {47399#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {46910#false} is VALID [2022-04-28 13:27:54,210 INFO L272 TraceCheckUtils]: 160: Hoare triple {46910#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46910#false} is VALID [2022-04-28 13:27:54,210 INFO L290 TraceCheckUtils]: 161: Hoare triple {46910#false} ~cond := #in~cond; {46910#false} is VALID [2022-04-28 13:27:54,211 INFO L290 TraceCheckUtils]: 162: Hoare triple {46910#false} assume 0 == ~cond; {46910#false} is VALID [2022-04-28 13:27:54,211 INFO L290 TraceCheckUtils]: 163: Hoare triple {46910#false} assume !false; {46910#false} is VALID [2022-04-28 13:27:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 46 proven. 1106 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 13:27:54,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:27:54,891 INFO L290 TraceCheckUtils]: 163: Hoare triple {46910#false} assume !false; {46910#false} is VALID [2022-04-28 13:27:54,891 INFO L290 TraceCheckUtils]: 162: Hoare triple {46910#false} assume 0 == ~cond; {46910#false} is VALID [2022-04-28 13:27:54,891 INFO L290 TraceCheckUtils]: 161: Hoare triple {46910#false} ~cond := #in~cond; {46910#false} is VALID [2022-04-28 13:27:54,891 INFO L272 TraceCheckUtils]: 160: Hoare triple {46910#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46910#false} is VALID [2022-04-28 13:27:54,891 INFO L290 TraceCheckUtils]: 159: Hoare triple {47427#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {46910#false} is VALID [2022-04-28 13:27:54,892 INFO L290 TraceCheckUtils]: 158: Hoare triple {47431#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47427#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:27:54,892 INFO L290 TraceCheckUtils]: 157: Hoare triple {47431#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,892 INFO L290 TraceCheckUtils]: 156: Hoare triple {47431#(< ~counter~0 100)} 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); {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,893 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {46909#true} {47431#(< ~counter~0 100)} #86#return; {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,893 INFO L290 TraceCheckUtils]: 154: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,893 INFO L290 TraceCheckUtils]: 153: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,893 INFO L290 TraceCheckUtils]: 152: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,893 INFO L272 TraceCheckUtils]: 151: Hoare triple {47431#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,893 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {46909#true} {47431#(< ~counter~0 100)} #84#return; {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,894 INFO L290 TraceCheckUtils]: 149: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,894 INFO L290 TraceCheckUtils]: 148: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,894 INFO L290 TraceCheckUtils]: 147: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,894 INFO L272 TraceCheckUtils]: 146: Hoare triple {47431#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,894 INFO L290 TraceCheckUtils]: 145: Hoare triple {47431#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,895 INFO L290 TraceCheckUtils]: 144: Hoare triple {47474#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47431#(< ~counter~0 100)} is VALID [2022-04-28 13:27:54,895 INFO L290 TraceCheckUtils]: 143: Hoare triple {47474#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,896 INFO L290 TraceCheckUtils]: 142: Hoare triple {47474#(< ~counter~0 99)} 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); {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,896 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {46909#true} {47474#(< ~counter~0 99)} #86#return; {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,896 INFO L290 TraceCheckUtils]: 140: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,896 INFO L290 TraceCheckUtils]: 139: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,896 INFO L290 TraceCheckUtils]: 138: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,896 INFO L272 TraceCheckUtils]: 137: Hoare triple {47474#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,897 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {46909#true} {47474#(< ~counter~0 99)} #84#return; {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,897 INFO L290 TraceCheckUtils]: 135: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,897 INFO L290 TraceCheckUtils]: 134: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,897 INFO L290 TraceCheckUtils]: 133: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,897 INFO L272 TraceCheckUtils]: 132: Hoare triple {47474#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,897 INFO L290 TraceCheckUtils]: 131: Hoare triple {47474#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,898 INFO L290 TraceCheckUtils]: 130: Hoare triple {47517#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47474#(< ~counter~0 99)} is VALID [2022-04-28 13:27:54,898 INFO L290 TraceCheckUtils]: 129: Hoare triple {47517#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,899 INFO L290 TraceCheckUtils]: 128: Hoare triple {47517#(< ~counter~0 98)} 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); {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,899 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {46909#true} {47517#(< ~counter~0 98)} #86#return; {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,899 INFO L290 TraceCheckUtils]: 126: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,899 INFO L290 TraceCheckUtils]: 125: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,899 INFO L290 TraceCheckUtils]: 124: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,899 INFO L272 TraceCheckUtils]: 123: Hoare triple {47517#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,900 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {46909#true} {47517#(< ~counter~0 98)} #84#return; {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,900 INFO L290 TraceCheckUtils]: 121: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,900 INFO L290 TraceCheckUtils]: 120: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,900 INFO L290 TraceCheckUtils]: 119: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,900 INFO L272 TraceCheckUtils]: 118: Hoare triple {47517#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,900 INFO L290 TraceCheckUtils]: 117: Hoare triple {47517#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,901 INFO L290 TraceCheckUtils]: 116: Hoare triple {47560#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47517#(< ~counter~0 98)} is VALID [2022-04-28 13:27:54,901 INFO L290 TraceCheckUtils]: 115: Hoare triple {47560#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {47560#(< ~counter~0 97)} 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); {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,902 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {46909#true} {47560#(< ~counter~0 97)} #86#return; {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,902 INFO L290 TraceCheckUtils]: 112: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,902 INFO L290 TraceCheckUtils]: 110: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,902 INFO L272 TraceCheckUtils]: 109: Hoare triple {47560#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,903 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {46909#true} {47560#(< ~counter~0 97)} #84#return; {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,903 INFO L290 TraceCheckUtils]: 107: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,903 INFO L290 TraceCheckUtils]: 106: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,903 INFO L290 TraceCheckUtils]: 105: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,903 INFO L272 TraceCheckUtils]: 104: Hoare triple {47560#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,903 INFO L290 TraceCheckUtils]: 103: Hoare triple {47560#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,904 INFO L290 TraceCheckUtils]: 102: Hoare triple {47603#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47560#(< ~counter~0 97)} is VALID [2022-04-28 13:27:54,904 INFO L290 TraceCheckUtils]: 101: Hoare triple {47603#(< ~counter~0 96)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,904 INFO L290 TraceCheckUtils]: 100: Hoare triple {47603#(< ~counter~0 96)} 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); {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,905 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {46909#true} {47603#(< ~counter~0 96)} #86#return; {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,905 INFO L290 TraceCheckUtils]: 98: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,905 INFO L290 TraceCheckUtils]: 97: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,905 INFO L290 TraceCheckUtils]: 96: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,905 INFO L272 TraceCheckUtils]: 95: Hoare triple {47603#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,906 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {46909#true} {47603#(< ~counter~0 96)} #84#return; {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,906 INFO L290 TraceCheckUtils]: 93: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,906 INFO L290 TraceCheckUtils]: 92: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,906 INFO L290 TraceCheckUtils]: 91: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,906 INFO L272 TraceCheckUtils]: 90: Hoare triple {47603#(< ~counter~0 96)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,906 INFO L290 TraceCheckUtils]: 89: Hoare triple {47603#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {47646#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47603#(< ~counter~0 96)} is VALID [2022-04-28 13:27:54,907 INFO L290 TraceCheckUtils]: 87: Hoare triple {47646#(< ~counter~0 95)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {47646#(< ~counter~0 95)} 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); {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,908 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {46909#true} {47646#(< ~counter~0 95)} #86#return; {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,908 INFO L272 TraceCheckUtils]: 81: Hoare triple {47646#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,909 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {46909#true} {47646#(< ~counter~0 95)} #84#return; {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,909 INFO L272 TraceCheckUtils]: 76: Hoare triple {47646#(< ~counter~0 95)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {47646#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {47689#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47646#(< ~counter~0 95)} is VALID [2022-04-28 13:27:54,910 INFO L290 TraceCheckUtils]: 73: Hoare triple {47689#(< ~counter~0 94)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {47689#(< ~counter~0 94)} 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); {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,911 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46909#true} {47689#(< ~counter~0 94)} #86#return; {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,911 INFO L290 TraceCheckUtils]: 70: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,911 INFO L272 TraceCheckUtils]: 67: Hoare triple {47689#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,911 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46909#true} {47689#(< ~counter~0 94)} #84#return; {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,912 INFO L272 TraceCheckUtils]: 62: Hoare triple {47689#(< ~counter~0 94)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {47689#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {47732#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47689#(< ~counter~0 94)} is VALID [2022-04-28 13:27:54,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {47732#(< ~counter~0 93)} assume !(~r~0 >= ~d~0); {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,913 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46909#true} {47732#(< ~counter~0 93)} #82#return; {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,913 INFO L290 TraceCheckUtils]: 56: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L272 TraceCheckUtils]: 54: Hoare triple {47732#(< ~counter~0 93)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46909#true} {47732#(< ~counter~0 93)} #80#return; {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,914 INFO L290 TraceCheckUtils]: 52: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,914 INFO L272 TraceCheckUtils]: 49: Hoare triple {47732#(< ~counter~0 93)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,915 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46909#true} {47732#(< ~counter~0 93)} #78#return; {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,915 INFO L272 TraceCheckUtils]: 44: Hoare triple {47732#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {47732#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {47787#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47732#(< ~counter~0 93)} is VALID [2022-04-28 13:27:54,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {47787#(< ~counter~0 92)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,917 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46909#true} {47787#(< ~counter~0 92)} #82#return; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L272 TraceCheckUtils]: 36: Hoare triple {47787#(< ~counter~0 92)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46909#true} {47787#(< ~counter~0 92)} #80#return; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,917 INFO L272 TraceCheckUtils]: 31: Hoare triple {47787#(< ~counter~0 92)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,918 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46909#true} {47787#(< ~counter~0 92)} #78#return; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,918 INFO L272 TraceCheckUtils]: 26: Hoare triple {47787#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {47787#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {47842#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47787#(< ~counter~0 92)} is VALID [2022-04-28 13:27:54,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {47842#(< ~counter~0 91)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,920 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46909#true} {47842#(< ~counter~0 91)} #82#return; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,920 INFO L272 TraceCheckUtils]: 18: Hoare triple {47842#(< ~counter~0 91)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,920 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46909#true} {47842#(< ~counter~0 91)} #80#return; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L272 TraceCheckUtils]: 13: Hoare triple {47842#(< ~counter~0 91)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46909#true} {47842#(< ~counter~0 91)} #78#return; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {46909#true} assume true; {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {46909#true} assume !(0 == ~cond); {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {46909#true} ~cond := #in~cond; {46909#true} is VALID [2022-04-28 13:27:54,921 INFO L272 TraceCheckUtils]: 8: Hoare triple {47842#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46909#true} is VALID [2022-04-28 13:27:54,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {47842#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {47897#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47842#(< ~counter~0 91)} is VALID [2022-04-28 13:27:54,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {47897#(< ~counter~0 90)} 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; {47897#(< ~counter~0 90)} is VALID [2022-04-28 13:27:54,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {47897#(< ~counter~0 90)} call #t~ret7 := main(); {47897#(< ~counter~0 90)} is VALID [2022-04-28 13:27:54,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47897#(< ~counter~0 90)} {46909#true} #92#return; {47897#(< ~counter~0 90)} is VALID [2022-04-28 13:27:54,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {47897#(< ~counter~0 90)} assume true; {47897#(< ~counter~0 90)} is VALID [2022-04-28 13:27:54,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {46909#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; {47897#(< ~counter~0 90)} is VALID [2022-04-28 13:27:54,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {46909#true} call ULTIMATE.init(); {46909#true} is VALID [2022-04-28 13:27:54,924 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-28 13:27:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:27:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693998480] [2022-04-28 13:27:54,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:27:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404925285] [2022-04-28 13:27:54,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404925285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:27:54,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:27:54,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 13:27:54,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:27:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943166207] [2022-04-28 13:27:54,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943166207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:27:54,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:27:54,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 13:27:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195069865] [2022-04-28 13:27:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:27:54,926 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-28 13:27:54,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:27:54,926 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-28 13:27:55,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 13:27:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 13:27:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 13:27:55,030 INFO L87 Difference]: Start difference. First operand 565 states and 640 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-28 13:27:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:56,769 INFO L93 Difference]: Finished difference Result 677 states and 778 transitions. [2022-04-28 13:27:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 13:27:56,769 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-28 13:27:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:27:56,769 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-28 13:27:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-28 13:27:56,771 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-28 13:27:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-28 13:27:56,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 239 transitions. [2022-04-28 13:27:56,984 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-28 13:27:57,003 INFO L225 Difference]: With dead ends: 677 [2022-04-28 13:27:57,003 INFO L226 Difference]: Without dead ends: 664 [2022-04-28 13:27:57,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=621, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 13:27:57,003 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:27:57,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 272 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:27:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-04-28 13:27:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 663. [2022-04-28 13:27:57,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:27:57,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 664 states. Second operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2022-04-28 13:27:57,972 INFO L74 IsIncluded]: Start isIncluded. First operand 664 states. Second operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2022-04-28 13:27:57,973 INFO L87 Difference]: Start difference. First operand 664 states. Second operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2022-04-28 13:27:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:57,987 INFO L93 Difference]: Finished difference Result 664 states and 756 transitions. [2022-04-28 13:27:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 756 transitions. [2022-04-28 13:27:57,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:57,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:57,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) Second operand 664 states. [2022-04-28 13:27:57,989 INFO L87 Difference]: Start difference. First operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) Second operand 664 states. [2022-04-28 13:27:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:27:58,003 INFO L93 Difference]: Finished difference Result 664 states and 756 transitions. [2022-04-28 13:27:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 756 transitions. [2022-04-28 13:27:58,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:27:58,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:27:58,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:27:58,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:27:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 453 states have (on average 1.1059602649006623) internal successors, (501), 466 states have internal predecessors, (501), 128 states have call successors, (128), 82 states have call predecessors, (128), 81 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2022-04-28 13:27:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 755 transitions. [2022-04-28 13:27:58,024 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 755 transitions. Word has length 164 [2022-04-28 13:27:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:27:58,024 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 755 transitions. [2022-04-28 13:27:58,024 INFO L496 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-28 13:27:58,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 663 states and 755 transitions. [2022-04-28 13:27:59,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 755 edges. 755 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:27:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 755 transitions. [2022-04-28 13:27:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-28 13:27:59,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:27:59,313 INFO L195 NwaCegarLoop]: 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-28 13:27:59,323 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-28 13:27:59,521 WARN L477 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-28 13:27:59,521 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:27:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:27:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 17 times [2022-04-28 13:27:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:27:59,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205319373] [2022-04-28 13:28:03,611 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:28:03,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:28:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 18 times [2022-04-28 13:28:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:28:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723745937] [2022-04-28 13:28:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:28:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:28:03,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:28:03,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442340513] [2022-04-28 13:28:03,627 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:28:03,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:28:03,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:28:03,628 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-28 13:28:03,629 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-28 13:28:03,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 13:28:03,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:28:03,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:28:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:28:03,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:28:04,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {51940#true} call ULTIMATE.init(); {51940#true} is VALID [2022-04-28 13:28:04,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {51940#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; {51940#true} is VALID [2022-04-28 13:28:04,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51940#true} {51940#true} #92#return; {51940#true} is VALID [2022-04-28 13:28:04,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {51940#true} call #t~ret7 := main(); {51940#true} is VALID [2022-04-28 13:28:04,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {51940#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; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {51960#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {51960#(= main_~p~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,129 INFO L272 TraceCheckUtils]: 8: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,129 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #78#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #80#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,130 INFO L272 TraceCheckUtils]: 18: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,131 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #82#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {51960#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {52015#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {52015#(= main_~p~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,132 INFO L272 TraceCheckUtils]: 26: Hoare triple {52015#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,132 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {51940#true} {52015#(= main_~p~0 2)} #78#return; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,132 INFO L272 TraceCheckUtils]: 31: Hoare triple {52015#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {51940#true} {52015#(= main_~p~0 2)} #80#return; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,133 INFO L272 TraceCheckUtils]: 36: Hoare triple {52015#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,134 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51940#true} {52015#(= main_~p~0 2)} #82#return; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {52015#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {52070#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {52070#(= main_~p~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,135 INFO L272 TraceCheckUtils]: 44: Hoare triple {52070#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,135 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {51940#true} {52070#(= main_~p~0 4)} #78#return; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,135 INFO L272 TraceCheckUtils]: 49: Hoare triple {52070#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {51940#true} {52070#(= main_~p~0 4)} #80#return; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,136 INFO L272 TraceCheckUtils]: 54: Hoare triple {52070#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,137 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {51940#true} {52070#(= main_~p~0 4)} #82#return; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {52070#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {52070#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {52070#(= main_~p~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,138 INFO L272 TraceCheckUtils]: 62: Hoare triple {52070#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {51940#true} {52070#(= main_~p~0 4)} #84#return; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,138 INFO L272 TraceCheckUtils]: 67: Hoare triple {52070#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,139 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51940#true} {52070#(= main_~p~0 4)} #86#return; {52070#(= main_~p~0 4)} is VALID [2022-04-28 13:28:04,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {52070#(= 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); {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {52015#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {52015#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {52015#(= main_~p~0 2)} assume !!(#t~post6 < 100);havoc #t~post6; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,140 INFO L272 TraceCheckUtils]: 76: Hoare triple {52015#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {51940#true} {52015#(= main_~p~0 2)} #84#return; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,141 INFO L272 TraceCheckUtils]: 81: Hoare triple {52015#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,142 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {51940#true} {52015#(= main_~p~0 2)} #86#return; {52015#(= main_~p~0 2)} is VALID [2022-04-28 13:28:04,142 INFO L290 TraceCheckUtils]: 86: Hoare triple {52015#(= 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); {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,142 INFO L290 TraceCheckUtils]: 87: Hoare triple {51960#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {51960#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {51960#(= main_~p~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,143 INFO L272 TraceCheckUtils]: 90: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,144 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #84#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,144 INFO L272 TraceCheckUtils]: 95: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,144 INFO L290 TraceCheckUtils]: 96: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,144 INFO L290 TraceCheckUtils]: 97: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,144 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #86#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {51960#(= 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); {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 102: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 103: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L272 TraceCheckUtils]: 104: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 106: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 107: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {51941#false} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L272 TraceCheckUtils]: 109: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 110: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,145 INFO L290 TraceCheckUtils]: 111: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 112: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {51941#false} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 114: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 115: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 116: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 117: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L272 TraceCheckUtils]: 118: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 119: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 120: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 121: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {51941#false} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L272 TraceCheckUtils]: 123: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 124: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 125: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L290 TraceCheckUtils]: 126: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,146 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51941#false} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 128: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 129: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 130: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 131: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L272 TraceCheckUtils]: 132: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 133: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 134: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 135: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {51941#false} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L272 TraceCheckUtils]: 137: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 138: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 139: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 140: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {51941#false} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 142: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,147 INFO L290 TraceCheckUtils]: 143: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 144: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 145: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L272 TraceCheckUtils]: 146: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 147: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 148: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 149: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {51941#false} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L272 TraceCheckUtils]: 151: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 152: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 153: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 154: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {51941#false} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 156: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 157: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,148 INFO L290 TraceCheckUtils]: 158: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 159: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L272 TraceCheckUtils]: 160: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 161: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 162: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 163: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {51941#false} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L272 TraceCheckUtils]: 165: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 166: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 167: Hoare triple {51941#false} assume !(0 == ~cond); {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 168: Hoare triple {51941#false} assume true; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {51941#false} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 170: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 171: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 172: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L290 TraceCheckUtils]: 173: Hoare triple {51941#false} assume !(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,149 INFO L272 TraceCheckUtils]: 174: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,150 INFO L290 TraceCheckUtils]: 175: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,150 INFO L290 TraceCheckUtils]: 176: Hoare triple {51941#false} assume 0 == ~cond; {51941#false} is VALID [2022-04-28 13:28:04,150 INFO L290 TraceCheckUtils]: 177: Hoare triple {51941#false} assume !false; {51941#false} is VALID [2022-04-28 13:28:04,150 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-28 13:28:04,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:28:04,832 INFO L290 TraceCheckUtils]: 177: Hoare triple {51941#false} assume !false; {51941#false} is VALID [2022-04-28 13:28:04,832 INFO L290 TraceCheckUtils]: 176: Hoare triple {51941#false} assume 0 == ~cond; {51941#false} is VALID [2022-04-28 13:28:04,832 INFO L290 TraceCheckUtils]: 175: Hoare triple {51941#false} ~cond := #in~cond; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L272 TraceCheckUtils]: 174: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 173: Hoare triple {51941#false} assume !(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 172: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 171: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 170: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {51940#true} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 168: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 167: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 166: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L272 TraceCheckUtils]: 165: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {51940#true} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 163: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 162: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L290 TraceCheckUtils]: 161: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,833 INFO L272 TraceCheckUtils]: 160: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 159: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 158: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 157: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 156: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {51940#true} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 154: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 153: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 152: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L272 TraceCheckUtils]: 151: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {51940#true} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 149: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 148: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 147: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L272 TraceCheckUtils]: 146: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,834 INFO L290 TraceCheckUtils]: 145: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 144: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 143: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 142: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {51940#true} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 140: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 139: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 138: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L272 TraceCheckUtils]: 137: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {51940#true} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 135: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 134: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 133: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L272 TraceCheckUtils]: 132: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 131: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,835 INFO L290 TraceCheckUtils]: 130: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 129: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 128: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51940#true} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 126: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 125: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 124: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L272 TraceCheckUtils]: 123: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {51940#true} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 121: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 120: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 119: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L272 TraceCheckUtils]: 118: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 117: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 116: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 115: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,836 INFO L290 TraceCheckUtils]: 114: Hoare triple {51941#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); {51941#false} is VALID [2022-04-28 13:28:04,837 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {51940#true} {51941#false} #86#return; {51941#false} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 112: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 111: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 110: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L272 TraceCheckUtils]: 109: Hoare triple {51941#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {51940#true} {51941#false} #84#return; {51941#false} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 107: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 106: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 105: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L272 TraceCheckUtils]: 104: Hoare triple {51941#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 103: Hoare triple {51941#false} assume !!(#t~post6 < 100);havoc #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 102: Hoare triple {51941#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51941#false} is VALID [2022-04-28 13:28:04,837 INFO L290 TraceCheckUtils]: 101: Hoare triple {51941#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51941#false} is VALID [2022-04-28 13:28:04,838 INFO L290 TraceCheckUtils]: 100: Hoare triple {51960#(= 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); {51941#false} is VALID [2022-04-28 13:28:04,838 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #86#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,838 INFO L290 TraceCheckUtils]: 98: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,838 INFO L290 TraceCheckUtils]: 97: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,838 INFO L290 TraceCheckUtils]: 96: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,838 INFO L272 TraceCheckUtils]: 95: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,838 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #84#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 93: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 92: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 91: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,839 INFO L272 TraceCheckUtils]: 90: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 89: Hoare triple {51960#(= main_~p~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 88: Hoare triple {51960#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,839 INFO L290 TraceCheckUtils]: 87: Hoare triple {51960#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {52752#(= (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); {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,841 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {51940#true} {52752#(= (div main_~p~0 2) 1)} #86#return; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L272 TraceCheckUtils]: 81: Hoare triple {52752#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {51940#true} {52752#(= (div main_~p~0 2) 1)} #84#return; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,841 INFO L272 TraceCheckUtils]: 76: Hoare triple {52752#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {52752#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 100);havoc #t~post6; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {52752#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,842 INFO L290 TraceCheckUtils]: 73: Hoare triple {52752#(= (div main_~p~0 2) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {52795#(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); {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,843 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51940#true} {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #86#return; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L272 TraceCheckUtils]: 67: Hoare triple {52795#(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)); {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {51940#true} {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #84#return; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,844 INFO L272 TraceCheckUtils]: 62: Hoare triple {52795#(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)); {51940#true} is VALID [2022-04-28 13:28:04,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {52795#(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; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {52795#(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); {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,846 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {51940#true} {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #82#return; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L272 TraceCheckUtils]: 54: Hoare triple {52795#(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)); {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {51940#true} {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #80#return; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L272 TraceCheckUtils]: 49: Hoare triple {52795#(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)); {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {51940#true} {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #78#return; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L272 TraceCheckUtils]: 44: Hoare triple {52795#(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)); {51940#true} is VALID [2022-04-28 13:28:04,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post5 < 100);havoc #t~post5; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {52795#(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; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {52752#(= (div main_~p~0 2) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52795#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:28:04,849 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51940#true} {52752#(= (div main_~p~0 2) 1)} #82#return; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,849 INFO L272 TraceCheckUtils]: 36: Hoare triple {52752#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {51940#true} {52752#(= (div main_~p~0 2) 1)} #80#return; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L272 TraceCheckUtils]: 31: Hoare triple {52752#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {51940#true} {52752#(= (div main_~p~0 2) 1)} #78#return; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,851 INFO L272 TraceCheckUtils]: 26: Hoare triple {52752#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {52752#(= (div main_~p~0 2) 1)} assume !!(#t~post5 < 100);havoc #t~post5; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {52752#(= (div main_~p~0 2) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {51960#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52752#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:28:04,852 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #82#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L272 TraceCheckUtils]: 18: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #80#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,852 INFO L272 TraceCheckUtils]: 13: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,853 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51940#true} {51960#(= main_~p~0 1)} #78#return; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {51940#true} assume !(0 == ~cond); {51940#true} is VALID [2022-04-28 13:28:04,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {51940#true} ~cond := #in~cond; {51940#true} is VALID [2022-04-28 13:28:04,853 INFO L272 TraceCheckUtils]: 8: Hoare triple {51960#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51940#true} is VALID [2022-04-28 13:28:04,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {51960#(= main_~p~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {51960#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {51940#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; {51960#(= main_~p~0 1)} is VALID [2022-04-28 13:28:04,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {51940#true} call #t~ret7 := main(); {51940#true} is VALID [2022-04-28 13:28:04,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51940#true} {51940#true} #92#return; {51940#true} is VALID [2022-04-28 13:28:04,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {51940#true} assume true; {51940#true} is VALID [2022-04-28 13:28:04,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {51940#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; {51940#true} is VALID [2022-04-28 13:28:04,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {51940#true} call ULTIMATE.init(); {51940#true} is VALID [2022-04-28 13:28:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 143 proven. 34 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2022-04-28 13:28:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:28:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723745937] [2022-04-28 13:28:04,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:28:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442340513] [2022-04-28 13:28:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442340513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:28:04,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:28:04,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-28 13:28:04,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:28:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205319373] [2022-04-28 13:28:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205319373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:28:04,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:28:04,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:28:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629408475] [2022-04-28 13:28:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:28:04,856 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-28 13:28:04,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:28:04,856 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-28 13:28:04,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:04,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:28:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:28:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:28:04,903 INFO L87 Difference]: Start difference. First operand 663 states and 755 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-28 13:28:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:05,995 INFO L93 Difference]: Finished difference Result 719 states and 820 transitions. [2022-04-28 13:28:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:28:05,995 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-28 13:28:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:28:05,995 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-28 13:28:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-28 13:28:05,996 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-28 13:28:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-28 13:28:05,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-04-28 13:28:06,081 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-28 13:28:06,095 INFO L225 Difference]: With dead ends: 719 [2022-04-28 13:28:06,095 INFO L226 Difference]: Without dead ends: 565 [2022-04-28 13:28:06,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:28:06,096 INFO L413 NwaCegarLoop]: 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-28 13:28:06,096 INFO L414 NwaCegarLoop]: 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-28 13:28:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-04-28 13:28:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-04-28 13:28:06,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:28:06,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-28 13:28:06,820 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-28 13:28:06,821 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-28 13:28:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:06,831 INFO L93 Difference]: Finished difference Result 565 states and 642 transitions. [2022-04-28 13:28:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 642 transitions. [2022-04-28 13:28:06,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:06,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:06,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) Second operand 565 states. [2022-04-28 13:28:06,833 INFO L87 Difference]: Start difference. First operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) Second operand 565 states. [2022-04-28 13:28:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:06,844 INFO L93 Difference]: Finished difference Result 565 states and 642 transitions. [2022-04-28 13:28:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 642 transitions. [2022-04-28 13:28:06,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:06,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:06,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:28:06,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:28:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 384 states have (on average 1.1041666666666667) internal successors, (424), 396 states have internal predecessors, (424), 110 states have call successors, (110), 71 states have call predecessors, (110), 70 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-28 13:28:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 642 transitions. [2022-04-28 13:28:06,874 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 642 transitions. Word has length 178 [2022-04-28 13:28:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:28:06,874 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 642 transitions. [2022-04-28 13:28:06,874 INFO L496 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-28 13:28:06,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 565 states and 642 transitions. [2022-04-28 13:28:08,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 642 edges. 642 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 642 transitions. [2022-04-28 13:28:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 13:28:08,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:28:08,277 INFO L195 NwaCegarLoop]: 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-28 13:28:08,294 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-28 13:28:08,477 WARN L477 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-28 13:28:08,477 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:28:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:28:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 5 times [2022-04-28 13:28:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282460614] [2022-04-28 13:28:12,569 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:28:12,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:28:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 6 times [2022-04-28 13:28:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:28:12,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673535012] [2022-04-28 13:28:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:28:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:28:12,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:28:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325511370] [2022-04-28 13:28:12,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:28:12,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:28:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:28:12,583 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-28 13:28:12,584 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-28 13:28:12,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 13:28:12,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:28:12,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 13:28:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:28:12,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:28:13,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {56712#true} call ULTIMATE.init(); {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {56712#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; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56712#true} {56712#true} #92#return; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {56712#true} call #t~ret7 := main(); {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {56712#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; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L272 TraceCheckUtils]: 8: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,003 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L272 TraceCheckUtils]: 13: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L272 TraceCheckUtils]: 18: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L272 TraceCheckUtils]: 26: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L272 TraceCheckUtils]: 31: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L272 TraceCheckUtils]: 36: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L272 TraceCheckUtils]: 44: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L272 TraceCheckUtils]: 49: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 50: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L272 TraceCheckUtils]: 54: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L272 TraceCheckUtils]: 62: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L272 TraceCheckUtils]: 67: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L272 TraceCheckUtils]: 72: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 77: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L272 TraceCheckUtils]: 80: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 82: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L272 TraceCheckUtils]: 85: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 87: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,008 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L272 TraceCheckUtils]: 90: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 91: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 92: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 93: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 95: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 96: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 97: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L272 TraceCheckUtils]: 98: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 99: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L272 TraceCheckUtils]: 103: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,009 INFO L290 TraceCheckUtils]: 104: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 105: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 106: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L272 TraceCheckUtils]: 108: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 109: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 110: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 111: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 113: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 114: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 115: Hoare triple {56712#true} assume !!(#t~post5 < 100);havoc #t~post5; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L272 TraceCheckUtils]: 116: Hoare triple {56712#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 117: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 118: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L290 TraceCheckUtils]: 119: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,010 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {56712#true} {56712#true} #78#return; {56712#true} is VALID [2022-04-28 13:28:13,011 INFO L272 TraceCheckUtils]: 121: Hoare triple {56712#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,011 INFO L290 TraceCheckUtils]: 122: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,011 INFO L290 TraceCheckUtils]: 123: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,011 INFO L290 TraceCheckUtils]: 124: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,011 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {56712#true} {56712#true} #80#return; {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L272 TraceCheckUtils]: 126: Hoare triple {56712#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L290 TraceCheckUtils]: 127: Hoare triple {56712#true} ~cond := #in~cond; {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L290 TraceCheckUtils]: 128: Hoare triple {56712#true} assume !(0 == ~cond); {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L290 TraceCheckUtils]: 129: Hoare triple {56712#true} assume true; {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {56712#true} {56712#true} #82#return; {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L290 TraceCheckUtils]: 131: Hoare triple {56712#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56712#true} is VALID [2022-04-28 13:28:13,012 INFO L290 TraceCheckUtils]: 132: Hoare triple {56712#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {57113#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 133: Hoare triple {57113#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 100);havoc #t~post5; {57117#(<= 101 ~counter~0)} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 134: Hoare triple {57117#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57121#(<= 101 |main_#t~post6|)} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 135: Hoare triple {57121#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,014 INFO L272 TraceCheckUtils]: 136: Hoare triple {56713#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 137: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 138: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,014 INFO L290 TraceCheckUtils]: 139: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {56713#false} {56713#false} #84#return; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L272 TraceCheckUtils]: 141: Hoare triple {56713#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 142: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 143: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 144: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {56713#false} {56713#false} #86#return; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 146: Hoare triple {56713#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); {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 147: Hoare triple {56713#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 148: Hoare triple {56713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 149: Hoare triple {56713#false} assume !!(#t~post6 < 100);havoc #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L272 TraceCheckUtils]: 150: Hoare triple {56713#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 151: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 152: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L290 TraceCheckUtils]: 153: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,015 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {56713#false} {56713#false} #84#return; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L272 TraceCheckUtils]: 155: Hoare triple {56713#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 156: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 157: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 158: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56713#false} {56713#false} #86#return; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 160: Hoare triple {56713#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); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 161: Hoare triple {56713#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 162: Hoare triple {56713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 163: Hoare triple {56713#false} assume !!(#t~post6 < 100);havoc #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L272 TraceCheckUtils]: 164: Hoare triple {56713#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 165: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 166: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 167: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {56713#false} {56713#false} #84#return; {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L272 TraceCheckUtils]: 169: Hoare triple {56713#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,016 INFO L290 TraceCheckUtils]: 170: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 171: Hoare triple {56713#false} assume !(0 == ~cond); {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 172: Hoare triple {56713#false} assume true; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {56713#false} {56713#false} #86#return; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 174: Hoare triple {56713#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); {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 175: Hoare triple {56713#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 176: Hoare triple {56713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 177: Hoare triple {56713#false} assume !(#t~post6 < 100);havoc #t~post6; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L272 TraceCheckUtils]: 178: Hoare triple {56713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 179: Hoare triple {56713#false} ~cond := #in~cond; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 180: Hoare triple {56713#false} assume 0 == ~cond; {56713#false} is VALID [2022-04-28 13:28:13,017 INFO L290 TraceCheckUtils]: 181: Hoare triple {56713#false} assume !false; {56713#false} is VALID [2022-04-28 13:28:13,018 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-28 13:28:13,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:28:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:28:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673535012] [2022-04-28 13:28:13,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:28:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325511370] [2022-04-28 13:28:13,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325511370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:28:13,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:28:13,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:28:13,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:28:13,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282460614] [2022-04-28 13:28:13,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282460614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:28:13,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:28:13,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:28:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155179879] [2022-04-28 13:28:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:28:13,019 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-28 13:28:13,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:28:13,020 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-28 13:28:13,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:13,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:28:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:28:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:28:13,047 INFO L87 Difference]: Start difference. First operand 565 states and 642 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-28 13:28:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:14,136 INFO L93 Difference]: Finished difference Result 640 states and 720 transitions. [2022-04-28 13:28:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:28:14,136 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-28 13:28:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:28:14,137 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-28 13:28:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 13:28:14,137 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-28 13:28:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 13:28:14,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 13:28:14,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:14,204 INFO L225 Difference]: With dead ends: 640 [2022-04-28 13:28:14,204 INFO L226 Difference]: Without dead ends: 527 [2022-04-28 13:28:14,204 INFO L412 NwaCegarLoop]: 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-28 13:28:14,205 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:28:14,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:28:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-04-28 13:28:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2022-04-28 13:28:15,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:28:15,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:28:15,132 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:28:15,133 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:28:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:15,142 INFO L93 Difference]: Finished difference Result 527 states and 590 transitions. [2022-04-28 13:28:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 590 transitions. [2022-04-28 13:28:15,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:15,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:15,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) Second operand 527 states. [2022-04-28 13:28:15,144 INFO L87 Difference]: Start difference. First operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) Second operand 527 states. [2022-04-28 13:28:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:15,153 INFO L93 Difference]: Finished difference Result 527 states and 590 transitions. [2022-04-28 13:28:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 590 transitions. [2022-04-28 13:28:15,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:15,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:15,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:28:15,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:28:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 356 states have (on average 1.0898876404494382) internal successors, (388), 366 states have internal predecessors, (388), 102 states have call successors, (102), 68 states have call predecessors, (102), 66 states have return successors, (99), 90 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:28:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 589 transitions. [2022-04-28 13:28:15,168 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 589 transitions. Word has length 182 [2022-04-28 13:28:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:28:15,168 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 589 transitions. [2022-04-28 13:28:15,168 INFO L496 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-28 13:28:15,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 525 states and 589 transitions. [2022-04-28 13:28:16,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 589 transitions. [2022-04-28 13:28:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 13:28:16,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:28:16,408 INFO L195 NwaCegarLoop]: 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-28 13:28:16,424 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-28 13:28:16,623 WARN L477 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-28 13:28:16,623 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:28:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:28:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 19 times [2022-04-28 13:28:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553101288] [2022-04-28 13:28:20,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:28:20,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:28:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 20 times [2022-04-28 13:28:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:28:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375562835] [2022-04-28 13:28:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:28:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:28:20,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:28:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327334510] [2022-04-28 13:28:20,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:28:20,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:28:20,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:28:20,207 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-28 13:28:20,208 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-28 13:28:20,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:28:20,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:28:20,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 13:28:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:28:20,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:28:21,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {60648#true} call ULTIMATE.init(); {60648#true} is VALID [2022-04-28 13:28:21,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {60648#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; {60656#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:21,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {60656#(<= ~counter~0 0)} assume true; {60656#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:21,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60656#(<= ~counter~0 0)} {60648#true} #92#return; {60656#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:21,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {60656#(<= ~counter~0 0)} call #t~ret7 := main(); {60656#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:21,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {60656#(<= ~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; {60656#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:21,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {60656#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {60672#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {60672#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {60672#(<= ~counter~0 1)} ~cond := #in~cond; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {60672#(<= ~counter~0 1)} assume !(0 == ~cond); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {60672#(<= ~counter~0 1)} assume true; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,097 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60672#(<= ~counter~0 1)} {60672#(<= ~counter~0 1)} #78#return; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,097 INFO L272 TraceCheckUtils]: 13: Hoare triple {60672#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {60672#(<= ~counter~0 1)} ~cond := #in~cond; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {60672#(<= ~counter~0 1)} assume !(0 == ~cond); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {60672#(<= ~counter~0 1)} assume true; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,098 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {60672#(<= ~counter~0 1)} {60672#(<= ~counter~0 1)} #80#return; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,098 INFO L272 TraceCheckUtils]: 18: Hoare triple {60672#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {60672#(<= ~counter~0 1)} ~cond := #in~cond; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {60672#(<= ~counter~0 1)} assume !(0 == ~cond); {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {60672#(<= ~counter~0 1)} assume true; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,099 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60672#(<= ~counter~0 1)} {60672#(<= ~counter~0 1)} #82#return; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {60672#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60672#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:21,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {60672#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {60727#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,100 INFO L272 TraceCheckUtils]: 26: Hoare triple {60727#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {60727#(<= ~counter~0 2)} ~cond := #in~cond; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {60727#(<= ~counter~0 2)} assume !(0 == ~cond); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {60727#(<= ~counter~0 2)} assume true; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,101 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60727#(<= ~counter~0 2)} {60727#(<= ~counter~0 2)} #78#return; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,101 INFO L272 TraceCheckUtils]: 31: Hoare triple {60727#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {60727#(<= ~counter~0 2)} ~cond := #in~cond; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {60727#(<= ~counter~0 2)} assume !(0 == ~cond); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {60727#(<= ~counter~0 2)} assume true; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,102 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {60727#(<= ~counter~0 2)} {60727#(<= ~counter~0 2)} #80#return; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,102 INFO L272 TraceCheckUtils]: 36: Hoare triple {60727#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {60727#(<= ~counter~0 2)} ~cond := #in~cond; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {60727#(<= ~counter~0 2)} assume !(0 == ~cond); {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {60727#(<= ~counter~0 2)} assume true; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,103 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60727#(<= ~counter~0 2)} {60727#(<= ~counter~0 2)} #82#return; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {60727#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60727#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:21,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {60727#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {60782#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,104 INFO L272 TraceCheckUtils]: 44: Hoare triple {60782#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {60782#(<= ~counter~0 3)} ~cond := #in~cond; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {60782#(<= ~counter~0 3)} assume !(0 == ~cond); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {60782#(<= ~counter~0 3)} assume true; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,105 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {60782#(<= ~counter~0 3)} {60782#(<= ~counter~0 3)} #78#return; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,105 INFO L272 TraceCheckUtils]: 49: Hoare triple {60782#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {60782#(<= ~counter~0 3)} ~cond := #in~cond; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {60782#(<= ~counter~0 3)} assume !(0 == ~cond); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {60782#(<= ~counter~0 3)} assume true; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,106 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {60782#(<= ~counter~0 3)} {60782#(<= ~counter~0 3)} #80#return; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,106 INFO L272 TraceCheckUtils]: 54: Hoare triple {60782#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {60782#(<= ~counter~0 3)} ~cond := #in~cond; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {60782#(<= ~counter~0 3)} assume !(0 == ~cond); {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {60782#(<= ~counter~0 3)} assume true; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,107 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {60782#(<= ~counter~0 3)} {60782#(<= ~counter~0 3)} #82#return; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {60782#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60782#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:21,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {60782#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {60837#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,108 INFO L272 TraceCheckUtils]: 62: Hoare triple {60837#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {60837#(<= ~counter~0 4)} ~cond := #in~cond; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {60837#(<= ~counter~0 4)} assume !(0 == ~cond); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {60837#(<= ~counter~0 4)} assume true; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,109 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {60837#(<= ~counter~0 4)} {60837#(<= ~counter~0 4)} #78#return; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,109 INFO L272 TraceCheckUtils]: 67: Hoare triple {60837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {60837#(<= ~counter~0 4)} ~cond := #in~cond; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {60837#(<= ~counter~0 4)} assume !(0 == ~cond); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {60837#(<= ~counter~0 4)} assume true; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,110 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60837#(<= ~counter~0 4)} {60837#(<= ~counter~0 4)} #80#return; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,110 INFO L272 TraceCheckUtils]: 72: Hoare triple {60837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,110 INFO L290 TraceCheckUtils]: 73: Hoare triple {60837#(<= ~counter~0 4)} ~cond := #in~cond; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,110 INFO L290 TraceCheckUtils]: 74: Hoare triple {60837#(<= ~counter~0 4)} assume !(0 == ~cond); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,111 INFO L290 TraceCheckUtils]: 75: Hoare triple {60837#(<= ~counter~0 4)} assume true; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,111 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {60837#(<= ~counter~0 4)} {60837#(<= ~counter~0 4)} #82#return; {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,111 INFO L290 TraceCheckUtils]: 77: Hoare triple {60837#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {60837#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:21,112 INFO L290 TraceCheckUtils]: 78: Hoare triple {60837#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,112 INFO L290 TraceCheckUtils]: 79: Hoare triple {60892#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,112 INFO L272 TraceCheckUtils]: 80: Hoare triple {60892#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {60892#(<= ~counter~0 5)} ~cond := #in~cond; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,112 INFO L290 TraceCheckUtils]: 82: Hoare triple {60892#(<= ~counter~0 5)} assume !(0 == ~cond); {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,113 INFO L290 TraceCheckUtils]: 83: Hoare triple {60892#(<= ~counter~0 5)} assume true; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,113 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {60892#(<= ~counter~0 5)} {60892#(<= ~counter~0 5)} #84#return; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,113 INFO L272 TraceCheckUtils]: 85: Hoare triple {60892#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {60892#(<= ~counter~0 5)} ~cond := #in~cond; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {60892#(<= ~counter~0 5)} assume !(0 == ~cond); {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {60892#(<= ~counter~0 5)} assume true; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,114 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {60892#(<= ~counter~0 5)} {60892#(<= ~counter~0 5)} #86#return; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,114 INFO L290 TraceCheckUtils]: 90: Hoare triple {60892#(<= ~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); {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,114 INFO L290 TraceCheckUtils]: 91: Hoare triple {60892#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60892#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:21,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {60892#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {60935#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,115 INFO L272 TraceCheckUtils]: 94: Hoare triple {60935#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,115 INFO L290 TraceCheckUtils]: 95: Hoare triple {60935#(<= ~counter~0 6)} ~cond := #in~cond; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {60935#(<= ~counter~0 6)} assume !(0 == ~cond); {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,116 INFO L290 TraceCheckUtils]: 97: Hoare triple {60935#(<= ~counter~0 6)} assume true; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,116 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {60935#(<= ~counter~0 6)} {60935#(<= ~counter~0 6)} #84#return; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,116 INFO L272 TraceCheckUtils]: 99: Hoare triple {60935#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,117 INFO L290 TraceCheckUtils]: 100: Hoare triple {60935#(<= ~counter~0 6)} ~cond := #in~cond; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,117 INFO L290 TraceCheckUtils]: 101: Hoare triple {60935#(<= ~counter~0 6)} assume !(0 == ~cond); {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,117 INFO L290 TraceCheckUtils]: 102: Hoare triple {60935#(<= ~counter~0 6)} assume true; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,117 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60935#(<= ~counter~0 6)} {60935#(<= ~counter~0 6)} #86#return; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,117 INFO L290 TraceCheckUtils]: 104: Hoare triple {60935#(<= ~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); {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,118 INFO L290 TraceCheckUtils]: 105: Hoare triple {60935#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60935#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:21,118 INFO L290 TraceCheckUtils]: 106: Hoare triple {60935#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,118 INFO L290 TraceCheckUtils]: 107: Hoare triple {60978#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,119 INFO L272 TraceCheckUtils]: 108: Hoare triple {60978#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,119 INFO L290 TraceCheckUtils]: 109: Hoare triple {60978#(<= ~counter~0 7)} ~cond := #in~cond; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,119 INFO L290 TraceCheckUtils]: 110: Hoare triple {60978#(<= ~counter~0 7)} assume !(0 == ~cond); {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,119 INFO L290 TraceCheckUtils]: 111: Hoare triple {60978#(<= ~counter~0 7)} assume true; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,119 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {60978#(<= ~counter~0 7)} {60978#(<= ~counter~0 7)} #84#return; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,120 INFO L272 TraceCheckUtils]: 113: Hoare triple {60978#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,120 INFO L290 TraceCheckUtils]: 114: Hoare triple {60978#(<= ~counter~0 7)} ~cond := #in~cond; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,120 INFO L290 TraceCheckUtils]: 115: Hoare triple {60978#(<= ~counter~0 7)} assume !(0 == ~cond); {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,120 INFO L290 TraceCheckUtils]: 116: Hoare triple {60978#(<= ~counter~0 7)} assume true; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,120 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {60978#(<= ~counter~0 7)} {60978#(<= ~counter~0 7)} #86#return; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {60978#(<= ~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); {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,121 INFO L290 TraceCheckUtils]: 119: Hoare triple {60978#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60978#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:21,121 INFO L290 TraceCheckUtils]: 120: Hoare triple {60978#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,121 INFO L290 TraceCheckUtils]: 121: Hoare triple {61021#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,122 INFO L272 TraceCheckUtils]: 122: Hoare triple {61021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,122 INFO L290 TraceCheckUtils]: 123: Hoare triple {61021#(<= ~counter~0 8)} ~cond := #in~cond; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,122 INFO L290 TraceCheckUtils]: 124: Hoare triple {61021#(<= ~counter~0 8)} assume !(0 == ~cond); {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,122 INFO L290 TraceCheckUtils]: 125: Hoare triple {61021#(<= ~counter~0 8)} assume true; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,123 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {61021#(<= ~counter~0 8)} {61021#(<= ~counter~0 8)} #84#return; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,123 INFO L272 TraceCheckUtils]: 127: Hoare triple {61021#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,123 INFO L290 TraceCheckUtils]: 128: Hoare triple {61021#(<= ~counter~0 8)} ~cond := #in~cond; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,123 INFO L290 TraceCheckUtils]: 129: Hoare triple {61021#(<= ~counter~0 8)} assume !(0 == ~cond); {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,123 INFO L290 TraceCheckUtils]: 130: Hoare triple {61021#(<= ~counter~0 8)} assume true; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,124 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {61021#(<= ~counter~0 8)} {61021#(<= ~counter~0 8)} #86#return; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,124 INFO L290 TraceCheckUtils]: 132: Hoare triple {61021#(<= ~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); {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,124 INFO L290 TraceCheckUtils]: 133: Hoare triple {61021#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61021#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:21,124 INFO L290 TraceCheckUtils]: 134: Hoare triple {61021#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,125 INFO L290 TraceCheckUtils]: 135: Hoare triple {61064#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,125 INFO L272 TraceCheckUtils]: 136: Hoare triple {61064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,125 INFO L290 TraceCheckUtils]: 137: Hoare triple {61064#(<= ~counter~0 9)} ~cond := #in~cond; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,125 INFO L290 TraceCheckUtils]: 138: Hoare triple {61064#(<= ~counter~0 9)} assume !(0 == ~cond); {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,125 INFO L290 TraceCheckUtils]: 139: Hoare triple {61064#(<= ~counter~0 9)} assume true; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,126 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {61064#(<= ~counter~0 9)} {61064#(<= ~counter~0 9)} #84#return; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,126 INFO L272 TraceCheckUtils]: 141: Hoare triple {61064#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,126 INFO L290 TraceCheckUtils]: 142: Hoare triple {61064#(<= ~counter~0 9)} ~cond := #in~cond; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,126 INFO L290 TraceCheckUtils]: 143: Hoare triple {61064#(<= ~counter~0 9)} assume !(0 == ~cond); {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,127 INFO L290 TraceCheckUtils]: 144: Hoare triple {61064#(<= ~counter~0 9)} assume true; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,127 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {61064#(<= ~counter~0 9)} {61064#(<= ~counter~0 9)} #86#return; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {61064#(<= ~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); {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,127 INFO L290 TraceCheckUtils]: 147: Hoare triple {61064#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61064#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:21,128 INFO L290 TraceCheckUtils]: 148: Hoare triple {61064#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,128 INFO L290 TraceCheckUtils]: 149: Hoare triple {61107#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,128 INFO L272 TraceCheckUtils]: 150: Hoare triple {61107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,128 INFO L290 TraceCheckUtils]: 151: Hoare triple {61107#(<= ~counter~0 10)} ~cond := #in~cond; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,129 INFO L290 TraceCheckUtils]: 152: Hoare triple {61107#(<= ~counter~0 10)} assume !(0 == ~cond); {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,129 INFO L290 TraceCheckUtils]: 153: Hoare triple {61107#(<= ~counter~0 10)} assume true; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,129 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {61107#(<= ~counter~0 10)} {61107#(<= ~counter~0 10)} #84#return; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,129 INFO L272 TraceCheckUtils]: 155: Hoare triple {61107#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,129 INFO L290 TraceCheckUtils]: 156: Hoare triple {61107#(<= ~counter~0 10)} ~cond := #in~cond; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,130 INFO L290 TraceCheckUtils]: 157: Hoare triple {61107#(<= ~counter~0 10)} assume !(0 == ~cond); {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,130 INFO L290 TraceCheckUtils]: 158: Hoare triple {61107#(<= ~counter~0 10)} assume true; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,130 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {61107#(<= ~counter~0 10)} {61107#(<= ~counter~0 10)} #86#return; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,130 INFO L290 TraceCheckUtils]: 160: Hoare triple {61107#(<= ~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); {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,130 INFO L290 TraceCheckUtils]: 161: Hoare triple {61107#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61107#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:21,131 INFO L290 TraceCheckUtils]: 162: Hoare triple {61107#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,131 INFO L290 TraceCheckUtils]: 163: Hoare triple {61150#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,131 INFO L272 TraceCheckUtils]: 164: Hoare triple {61150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,132 INFO L290 TraceCheckUtils]: 165: Hoare triple {61150#(<= ~counter~0 11)} ~cond := #in~cond; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,132 INFO L290 TraceCheckUtils]: 166: Hoare triple {61150#(<= ~counter~0 11)} assume !(0 == ~cond); {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,132 INFO L290 TraceCheckUtils]: 167: Hoare triple {61150#(<= ~counter~0 11)} assume true; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,132 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {61150#(<= ~counter~0 11)} {61150#(<= ~counter~0 11)} #84#return; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,133 INFO L272 TraceCheckUtils]: 169: Hoare triple {61150#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,133 INFO L290 TraceCheckUtils]: 170: Hoare triple {61150#(<= ~counter~0 11)} ~cond := #in~cond; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,133 INFO L290 TraceCheckUtils]: 171: Hoare triple {61150#(<= ~counter~0 11)} assume !(0 == ~cond); {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,133 INFO L290 TraceCheckUtils]: 172: Hoare triple {61150#(<= ~counter~0 11)} assume true; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,133 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {61150#(<= ~counter~0 11)} {61150#(<= ~counter~0 11)} #86#return; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 174: Hoare triple {61150#(<= ~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); {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 175: Hoare triple {61150#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61150#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 176: Hoare triple {61150#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61193#(<= |main_#t~post6| 11)} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 177: Hoare triple {61193#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {60649#false} is VALID [2022-04-28 13:28:21,134 INFO L272 TraceCheckUtils]: 178: Hoare triple {60649#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {60649#false} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 179: Hoare triple {60649#false} ~cond := #in~cond; {60649#false} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 180: Hoare triple {60649#false} assume 0 == ~cond; {60649#false} is VALID [2022-04-28 13:28:21,134 INFO L290 TraceCheckUtils]: 181: Hoare triple {60649#false} assume !false; {60649#false} is VALID [2022-04-28 13:28:21,135 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-28 13:28:21,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:28:21,670 INFO L290 TraceCheckUtils]: 181: Hoare triple {60649#false} assume !false; {60649#false} is VALID [2022-04-28 13:28:21,671 INFO L290 TraceCheckUtils]: 180: Hoare triple {60649#false} assume 0 == ~cond; {60649#false} is VALID [2022-04-28 13:28:21,671 INFO L290 TraceCheckUtils]: 179: Hoare triple {60649#false} ~cond := #in~cond; {60649#false} is VALID [2022-04-28 13:28:21,671 INFO L272 TraceCheckUtils]: 178: Hoare triple {60649#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {60649#false} is VALID [2022-04-28 13:28:21,691 INFO L290 TraceCheckUtils]: 177: Hoare triple {61221#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {60649#false} is VALID [2022-04-28 13:28:21,692 INFO L290 TraceCheckUtils]: 176: Hoare triple {61225#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61221#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:28:21,692 INFO L290 TraceCheckUtils]: 175: Hoare triple {61225#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,692 INFO L290 TraceCheckUtils]: 174: Hoare triple {61225#(< ~counter~0 100)} 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); {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,693 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {60648#true} {61225#(< ~counter~0 100)} #86#return; {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,693 INFO L290 TraceCheckUtils]: 172: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,693 INFO L290 TraceCheckUtils]: 171: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,693 INFO L290 TraceCheckUtils]: 170: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,693 INFO L272 TraceCheckUtils]: 169: Hoare triple {61225#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,694 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {60648#true} {61225#(< ~counter~0 100)} #84#return; {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,694 INFO L290 TraceCheckUtils]: 167: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,694 INFO L290 TraceCheckUtils]: 166: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,694 INFO L290 TraceCheckUtils]: 165: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,694 INFO L272 TraceCheckUtils]: 164: Hoare triple {61225#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,694 INFO L290 TraceCheckUtils]: 163: Hoare triple {61225#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,696 INFO L290 TraceCheckUtils]: 162: Hoare triple {61268#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61225#(< ~counter~0 100)} is VALID [2022-04-28 13:28:21,696 INFO L290 TraceCheckUtils]: 161: Hoare triple {61268#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,696 INFO L290 TraceCheckUtils]: 160: Hoare triple {61268#(< ~counter~0 99)} 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); {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,697 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {60648#true} {61268#(< ~counter~0 99)} #86#return; {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,697 INFO L290 TraceCheckUtils]: 158: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,697 INFO L290 TraceCheckUtils]: 157: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,697 INFO L290 TraceCheckUtils]: 156: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,697 INFO L272 TraceCheckUtils]: 155: Hoare triple {61268#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,698 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {60648#true} {61268#(< ~counter~0 99)} #84#return; {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,698 INFO L290 TraceCheckUtils]: 153: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,698 INFO L290 TraceCheckUtils]: 152: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,698 INFO L290 TraceCheckUtils]: 151: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,698 INFO L272 TraceCheckUtils]: 150: Hoare triple {61268#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,698 INFO L290 TraceCheckUtils]: 149: Hoare triple {61268#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,699 INFO L290 TraceCheckUtils]: 148: Hoare triple {61311#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61268#(< ~counter~0 99)} is VALID [2022-04-28 13:28:21,699 INFO L290 TraceCheckUtils]: 147: Hoare triple {61311#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,699 INFO L290 TraceCheckUtils]: 146: Hoare triple {61311#(< ~counter~0 98)} 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); {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,700 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {60648#true} {61311#(< ~counter~0 98)} #86#return; {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,700 INFO L290 TraceCheckUtils]: 144: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,700 INFO L290 TraceCheckUtils]: 143: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,700 INFO L290 TraceCheckUtils]: 142: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,700 INFO L272 TraceCheckUtils]: 141: Hoare triple {61311#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,701 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {60648#true} {61311#(< ~counter~0 98)} #84#return; {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,701 INFO L290 TraceCheckUtils]: 139: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,701 INFO L290 TraceCheckUtils]: 138: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,701 INFO L290 TraceCheckUtils]: 137: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,701 INFO L272 TraceCheckUtils]: 136: Hoare triple {61311#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,701 INFO L290 TraceCheckUtils]: 135: Hoare triple {61311#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,702 INFO L290 TraceCheckUtils]: 134: Hoare triple {61354#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61311#(< ~counter~0 98)} is VALID [2022-04-28 13:28:21,702 INFO L290 TraceCheckUtils]: 133: Hoare triple {61354#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,703 INFO L290 TraceCheckUtils]: 132: Hoare triple {61354#(< ~counter~0 97)} 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); {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,703 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {60648#true} {61354#(< ~counter~0 97)} #86#return; {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,703 INFO L290 TraceCheckUtils]: 130: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,703 INFO L290 TraceCheckUtils]: 129: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,703 INFO L290 TraceCheckUtils]: 128: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,703 INFO L272 TraceCheckUtils]: 127: Hoare triple {61354#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,704 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {60648#true} {61354#(< ~counter~0 97)} #84#return; {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,704 INFO L290 TraceCheckUtils]: 125: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,704 INFO L290 TraceCheckUtils]: 124: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,704 INFO L290 TraceCheckUtils]: 123: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,704 INFO L272 TraceCheckUtils]: 122: Hoare triple {61354#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,705 INFO L290 TraceCheckUtils]: 121: Hoare triple {61354#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,705 INFO L290 TraceCheckUtils]: 120: Hoare triple {61397#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61354#(< ~counter~0 97)} is VALID [2022-04-28 13:28:21,706 INFO L290 TraceCheckUtils]: 119: Hoare triple {61397#(< ~counter~0 96)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,706 INFO L290 TraceCheckUtils]: 118: Hoare triple {61397#(< ~counter~0 96)} 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); {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,706 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {60648#true} {61397#(< ~counter~0 96)} #86#return; {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,706 INFO L290 TraceCheckUtils]: 116: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L290 TraceCheckUtils]: 115: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L290 TraceCheckUtils]: 114: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L272 TraceCheckUtils]: 113: Hoare triple {61397#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {60648#true} {61397#(< ~counter~0 96)} #84#return; {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,707 INFO L290 TraceCheckUtils]: 111: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L290 TraceCheckUtils]: 110: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L290 TraceCheckUtils]: 109: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,707 INFO L272 TraceCheckUtils]: 108: Hoare triple {61397#(< ~counter~0 96)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {61397#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,708 INFO L290 TraceCheckUtils]: 106: Hoare triple {61440#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61397#(< ~counter~0 96)} is VALID [2022-04-28 13:28:21,709 INFO L290 TraceCheckUtils]: 105: Hoare triple {61440#(< ~counter~0 95)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,709 INFO L290 TraceCheckUtils]: 104: Hoare triple {61440#(< ~counter~0 95)} 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); {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,709 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60648#true} {61440#(< ~counter~0 95)} #86#return; {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,709 INFO L290 TraceCheckUtils]: 102: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,709 INFO L290 TraceCheckUtils]: 101: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L272 TraceCheckUtils]: 99: Hoare triple {61440#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {60648#true} {61440#(< ~counter~0 95)} #84#return; {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,710 INFO L290 TraceCheckUtils]: 97: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L290 TraceCheckUtils]: 96: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L290 TraceCheckUtils]: 95: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,710 INFO L272 TraceCheckUtils]: 94: Hoare triple {61440#(< ~counter~0 95)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {61440#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,711 INFO L290 TraceCheckUtils]: 92: Hoare triple {61483#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61440#(< ~counter~0 95)} is VALID [2022-04-28 13:28:21,712 INFO L290 TraceCheckUtils]: 91: Hoare triple {61483#(< ~counter~0 94)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {61483#(< ~counter~0 94)} 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); {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,712 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {60648#true} {61483#(< ~counter~0 94)} #86#return; {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,712 INFO L290 TraceCheckUtils]: 88: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,712 INFO L290 TraceCheckUtils]: 87: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L290 TraceCheckUtils]: 86: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L272 TraceCheckUtils]: 85: Hoare triple {61483#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {60648#true} {61483#(< ~counter~0 94)} #84#return; {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,713 INFO L290 TraceCheckUtils]: 83: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,713 INFO L272 TraceCheckUtils]: 80: Hoare triple {61483#(< ~counter~0 94)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,714 INFO L290 TraceCheckUtils]: 79: Hoare triple {61483#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,714 INFO L290 TraceCheckUtils]: 78: Hoare triple {61526#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61483#(< ~counter~0 94)} is VALID [2022-04-28 13:28:21,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {61526#(< ~counter~0 93)} assume !(~r~0 >= ~d~0); {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,715 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {60648#true} {61526#(< ~counter~0 93)} #82#return; {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,715 INFO L272 TraceCheckUtils]: 72: Hoare triple {61526#(< ~counter~0 93)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60648#true} {61526#(< ~counter~0 93)} #80#return; {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L272 TraceCheckUtils]: 67: Hoare triple {61526#(< ~counter~0 93)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {60648#true} {61526#(< ~counter~0 93)} #78#return; {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,717 INFO L272 TraceCheckUtils]: 62: Hoare triple {61526#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {61526#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {61581#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61526#(< ~counter~0 93)} is VALID [2022-04-28 13:28:21,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {61581#(< ~counter~0 92)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,718 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {60648#true} {61581#(< ~counter~0 92)} #82#return; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,718 INFO L290 TraceCheckUtils]: 55: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,719 INFO L272 TraceCheckUtils]: 54: Hoare triple {61581#(< ~counter~0 92)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,719 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {60648#true} {61581#(< ~counter~0 92)} #80#return; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,719 INFO L290 TraceCheckUtils]: 51: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,719 INFO L272 TraceCheckUtils]: 49: Hoare triple {61581#(< ~counter~0 92)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,720 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {60648#true} {61581#(< ~counter~0 92)} #78#return; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,720 INFO L272 TraceCheckUtils]: 44: Hoare triple {61581#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {61581#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {61636#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61581#(< ~counter~0 92)} is VALID [2022-04-28 13:28:21,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {61636#(< ~counter~0 91)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,722 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60648#true} {61636#(< ~counter~0 91)} #82#return; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L272 TraceCheckUtils]: 36: Hoare triple {61636#(< ~counter~0 91)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {60648#true} {61636#(< ~counter~0 91)} #80#return; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,722 INFO L272 TraceCheckUtils]: 31: Hoare triple {61636#(< ~counter~0 91)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,723 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60648#true} {61636#(< ~counter~0 91)} #78#return; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,723 INFO L272 TraceCheckUtils]: 26: Hoare triple {61636#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {61636#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {61691#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61636#(< ~counter~0 91)} is VALID [2022-04-28 13:28:21,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {61691#(< ~counter~0 90)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,725 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60648#true} {61691#(< ~counter~0 90)} #82#return; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,725 INFO L272 TraceCheckUtils]: 18: Hoare triple {61691#(< ~counter~0 90)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {60648#true} {61691#(< ~counter~0 90)} #80#return; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L272 TraceCheckUtils]: 13: Hoare triple {61691#(< ~counter~0 90)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60648#true} {61691#(< ~counter~0 90)} #78#return; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {60648#true} assume true; {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {60648#true} assume !(0 == ~cond); {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {60648#true} ~cond := #in~cond; {60648#true} is VALID [2022-04-28 13:28:21,726 INFO L272 TraceCheckUtils]: 8: Hoare triple {61691#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60648#true} is VALID [2022-04-28 13:28:21,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {61691#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {61746#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61691#(< ~counter~0 90)} is VALID [2022-04-28 13:28:21,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {61746#(< ~counter~0 89)} 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; {61746#(< ~counter~0 89)} is VALID [2022-04-28 13:28:21,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {61746#(< ~counter~0 89)} call #t~ret7 := main(); {61746#(< ~counter~0 89)} is VALID [2022-04-28 13:28:21,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61746#(< ~counter~0 89)} {60648#true} #92#return; {61746#(< ~counter~0 89)} is VALID [2022-04-28 13:28:21,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {61746#(< ~counter~0 89)} assume true; {61746#(< ~counter~0 89)} is VALID [2022-04-28 13:28:21,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {60648#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; {61746#(< ~counter~0 89)} is VALID [2022-04-28 13:28:21,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {60648#true} call ULTIMATE.init(); {60648#true} is VALID [2022-04-28 13:28:21,729 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-28 13:28:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:28:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375562835] [2022-04-28 13:28:21,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:28:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327334510] [2022-04-28 13:28:21,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327334510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:28:21,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:28:21,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 13:28:21,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:28:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553101288] [2022-04-28 13:28:21,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553101288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:28:21,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:28:21,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 13:28:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727856644] [2022-04-28 13:28:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:28:21,731 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-28 13:28:21,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:28:21,731 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-28 13:28:21,842 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-28 13:28:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 13:28:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 13:28:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 13:28:21,843 INFO L87 Difference]: Start difference. First operand 525 states and 589 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-28 13:28:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:23,951 INFO L93 Difference]: Finished difference Result 619 states and 701 transitions. [2022-04-28 13:28:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 13:28:23,951 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-28 13:28:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:28:23,951 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-28 13:28:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-28 13:28:23,955 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-28 13:28:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-28 13:28:23,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 250 transitions. [2022-04-28 13:28:24,146 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-28 13:28:24,169 INFO L225 Difference]: With dead ends: 619 [2022-04-28 13:28:24,170 INFO L226 Difference]: Without dead ends: 596 [2022-04-28 13:28:24,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=491, Invalid=699, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 13:28:24,170 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 103 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:28:24,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 322 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:28:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-04-28 13:28:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 595. [2022-04-28 13:28:24,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:28:24,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 596 states. Second operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) [2022-04-28 13:28:24,909 INFO L74 IsIncluded]: Start isIncluded. First operand 596 states. Second operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) [2022-04-28 13:28:24,909 INFO L87 Difference]: Start difference. First operand 596 states. Second operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) [2022-04-28 13:28:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:24,921 INFO L93 Difference]: Finished difference Result 596 states and 671 transitions. [2022-04-28 13:28:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 671 transitions. [2022-04-28 13:28:24,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:24,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:24,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) Second operand 596 states. [2022-04-28 13:28:24,923 INFO L87 Difference]: Start difference. First operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) Second operand 596 states. [2022-04-28 13:28:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:24,934 INFO L93 Difference]: Finished difference Result 596 states and 671 transitions. [2022-04-28 13:28:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 671 transitions. [2022-04-28 13:28:24,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:24,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:24,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:28:24,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:28:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 403 states have (on average 1.0893300248138957) internal successors, (439), 415 states have internal predecessors, (439), 117 states have call successors, (117), 76 states have call predecessors, (117), 74 states have return successors, (114), 103 states have call predecessors, (114), 114 states have call successors, (114) [2022-04-28 13:28:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 670 transitions. [2022-04-28 13:28:24,952 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 670 transitions. Word has length 182 [2022-04-28 13:28:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:28:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 670 transitions. [2022-04-28 13:28:24,953 INFO L496 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-28 13:28:24,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 670 transitions. [2022-04-28 13:28:26,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 670 edges. 670 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 670 transitions. [2022-04-28 13:28:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-28 13:28:26,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:28:26,276 INFO L195 NwaCegarLoop]: 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-28 13:28:26,296 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-28 13:28:26,489 WARN L477 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-28 13:28:26,489 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:28:26,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:28:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 21 times [2022-04-28 13:28:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902438563] [2022-04-28 13:28:28,567 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:28:28,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:28:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 22 times [2022-04-28 13:28:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:28:28,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859986365] [2022-04-28 13:28:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:28:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:28:28,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:28:28,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073191223] [2022-04-28 13:28:28,591 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:28:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:28:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:28:28,592 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-28 13:28:28,593 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-28 13:28:34,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:28:34,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:28:34,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 13:28:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:28:34,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:28:35,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {65401#true} call ULTIMATE.init(); {65401#true} is VALID [2022-04-28 13:28:35,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {65401#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; {65409#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:35,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {65409#(<= ~counter~0 0)} assume true; {65409#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:35,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65409#(<= ~counter~0 0)} {65401#true} #92#return; {65409#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:35,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {65409#(<= ~counter~0 0)} call #t~ret7 := main(); {65409#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:35,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {65409#(<= ~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; {65409#(<= ~counter~0 0)} is VALID [2022-04-28 13:28:35,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {65409#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {65425#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {65425#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {65425#(<= ~counter~0 1)} ~cond := #in~cond; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {65425#(<= ~counter~0 1)} assume !(0 == ~cond); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {65425#(<= ~counter~0 1)} assume true; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,434 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65425#(<= ~counter~0 1)} {65425#(<= ~counter~0 1)} #78#return; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,434 INFO L272 TraceCheckUtils]: 13: Hoare triple {65425#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {65425#(<= ~counter~0 1)} ~cond := #in~cond; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {65425#(<= ~counter~0 1)} assume !(0 == ~cond); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {65425#(<= ~counter~0 1)} assume true; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,436 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {65425#(<= ~counter~0 1)} {65425#(<= ~counter~0 1)} #80#return; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,436 INFO L272 TraceCheckUtils]: 18: Hoare triple {65425#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {65425#(<= ~counter~0 1)} ~cond := #in~cond; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {65425#(<= ~counter~0 1)} assume !(0 == ~cond); {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {65425#(<= ~counter~0 1)} assume true; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,437 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65425#(<= ~counter~0 1)} {65425#(<= ~counter~0 1)} #82#return; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {65425#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65425#(<= ~counter~0 1)} is VALID [2022-04-28 13:28:35,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {65425#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {65480#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,439 INFO L272 TraceCheckUtils]: 26: Hoare triple {65480#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {65480#(<= ~counter~0 2)} ~cond := #in~cond; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {65480#(<= ~counter~0 2)} assume !(0 == ~cond); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {65480#(<= ~counter~0 2)} assume true; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,440 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {65480#(<= ~counter~0 2)} {65480#(<= ~counter~0 2)} #78#return; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,441 INFO L272 TraceCheckUtils]: 31: Hoare triple {65480#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {65480#(<= ~counter~0 2)} ~cond := #in~cond; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {65480#(<= ~counter~0 2)} assume !(0 == ~cond); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {65480#(<= ~counter~0 2)} assume true; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,442 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {65480#(<= ~counter~0 2)} {65480#(<= ~counter~0 2)} #80#return; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,442 INFO L272 TraceCheckUtils]: 36: Hoare triple {65480#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {65480#(<= ~counter~0 2)} ~cond := #in~cond; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {65480#(<= ~counter~0 2)} assume !(0 == ~cond); {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {65480#(<= ~counter~0 2)} assume true; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,444 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65480#(<= ~counter~0 2)} {65480#(<= ~counter~0 2)} #82#return; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {65480#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65480#(<= ~counter~0 2)} is VALID [2022-04-28 13:28:35,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {65480#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {65535#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,445 INFO L272 TraceCheckUtils]: 44: Hoare triple {65535#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {65535#(<= ~counter~0 3)} ~cond := #in~cond; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {65535#(<= ~counter~0 3)} assume !(0 == ~cond); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {65535#(<= ~counter~0 3)} assume true; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,446 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {65535#(<= ~counter~0 3)} {65535#(<= ~counter~0 3)} #78#return; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,447 INFO L272 TraceCheckUtils]: 49: Hoare triple {65535#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {65535#(<= ~counter~0 3)} ~cond := #in~cond; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {65535#(<= ~counter~0 3)} assume !(0 == ~cond); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {65535#(<= ~counter~0 3)} assume true; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,448 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {65535#(<= ~counter~0 3)} {65535#(<= ~counter~0 3)} #80#return; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,448 INFO L272 TraceCheckUtils]: 54: Hoare triple {65535#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {65535#(<= ~counter~0 3)} ~cond := #in~cond; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {65535#(<= ~counter~0 3)} assume !(0 == ~cond); {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {65535#(<= ~counter~0 3)} assume true; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,450 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {65535#(<= ~counter~0 3)} {65535#(<= ~counter~0 3)} #82#return; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {65535#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {65535#(<= ~counter~0 3)} is VALID [2022-04-28 13:28:35,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {65535#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {65590#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,451 INFO L272 TraceCheckUtils]: 62: Hoare triple {65590#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {65590#(<= ~counter~0 4)} ~cond := #in~cond; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {65590#(<= ~counter~0 4)} assume !(0 == ~cond); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,452 INFO L290 TraceCheckUtils]: 65: Hoare triple {65590#(<= ~counter~0 4)} assume true; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,452 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {65590#(<= ~counter~0 4)} {65590#(<= ~counter~0 4)} #78#return; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,453 INFO L272 TraceCheckUtils]: 67: Hoare triple {65590#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {65590#(<= ~counter~0 4)} ~cond := #in~cond; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {65590#(<= ~counter~0 4)} assume !(0 == ~cond); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {65590#(<= ~counter~0 4)} assume true; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,454 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65590#(<= ~counter~0 4)} {65590#(<= ~counter~0 4)} #80#return; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,455 INFO L272 TraceCheckUtils]: 72: Hoare triple {65590#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {65590#(<= ~counter~0 4)} ~cond := #in~cond; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {65590#(<= ~counter~0 4)} assume !(0 == ~cond); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {65590#(<= ~counter~0 4)} assume true; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,456 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {65590#(<= ~counter~0 4)} {65590#(<= ~counter~0 4)} #82#return; {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {65590#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {65590#(<= ~counter~0 4)} is VALID [2022-04-28 13:28:35,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {65590#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,458 INFO L290 TraceCheckUtils]: 79: Hoare triple {65645#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,458 INFO L272 TraceCheckUtils]: 80: Hoare triple {65645#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {65645#(<= ~counter~0 5)} ~cond := #in~cond; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,459 INFO L290 TraceCheckUtils]: 82: Hoare triple {65645#(<= ~counter~0 5)} assume !(0 == ~cond); {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {65645#(<= ~counter~0 5)} assume true; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,459 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {65645#(<= ~counter~0 5)} {65645#(<= ~counter~0 5)} #84#return; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,460 INFO L272 TraceCheckUtils]: 85: Hoare triple {65645#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {65645#(<= ~counter~0 5)} ~cond := #in~cond; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,460 INFO L290 TraceCheckUtils]: 87: Hoare triple {65645#(<= ~counter~0 5)} assume !(0 == ~cond); {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,461 INFO L290 TraceCheckUtils]: 88: Hoare triple {65645#(<= ~counter~0 5)} assume true; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,461 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {65645#(<= ~counter~0 5)} {65645#(<= ~counter~0 5)} #86#return; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,461 INFO L290 TraceCheckUtils]: 90: Hoare triple {65645#(<= ~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); {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {65645#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65645#(<= ~counter~0 5)} is VALID [2022-04-28 13:28:35,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {65645#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {65688#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,463 INFO L272 TraceCheckUtils]: 94: Hoare triple {65688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {65688#(<= ~counter~0 6)} ~cond := #in~cond; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {65688#(<= ~counter~0 6)} assume !(0 == ~cond); {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {65688#(<= ~counter~0 6)} assume true; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,465 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {65688#(<= ~counter~0 6)} {65688#(<= ~counter~0 6)} #84#return; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,465 INFO L272 TraceCheckUtils]: 99: Hoare triple {65688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,465 INFO L290 TraceCheckUtils]: 100: Hoare triple {65688#(<= ~counter~0 6)} ~cond := #in~cond; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {65688#(<= ~counter~0 6)} assume !(0 == ~cond); {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {65688#(<= ~counter~0 6)} assume true; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,466 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65688#(<= ~counter~0 6)} {65688#(<= ~counter~0 6)} #86#return; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,467 INFO L290 TraceCheckUtils]: 104: Hoare triple {65688#(<= ~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); {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,467 INFO L290 TraceCheckUtils]: 105: Hoare triple {65688#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65688#(<= ~counter~0 6)} is VALID [2022-04-28 13:28:35,467 INFO L290 TraceCheckUtils]: 106: Hoare triple {65688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,468 INFO L290 TraceCheckUtils]: 107: Hoare triple {65731#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,468 INFO L272 TraceCheckUtils]: 108: Hoare triple {65731#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,469 INFO L290 TraceCheckUtils]: 109: Hoare triple {65731#(<= ~counter~0 7)} ~cond := #in~cond; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,469 INFO L290 TraceCheckUtils]: 110: Hoare triple {65731#(<= ~counter~0 7)} assume !(0 == ~cond); {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,469 INFO L290 TraceCheckUtils]: 111: Hoare triple {65731#(<= ~counter~0 7)} assume true; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,470 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {65731#(<= ~counter~0 7)} {65731#(<= ~counter~0 7)} #84#return; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,470 INFO L272 TraceCheckUtils]: 113: Hoare triple {65731#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,470 INFO L290 TraceCheckUtils]: 114: Hoare triple {65731#(<= ~counter~0 7)} ~cond := #in~cond; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,470 INFO L290 TraceCheckUtils]: 115: Hoare triple {65731#(<= ~counter~0 7)} assume !(0 == ~cond); {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,471 INFO L290 TraceCheckUtils]: 116: Hoare triple {65731#(<= ~counter~0 7)} assume true; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,471 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {65731#(<= ~counter~0 7)} {65731#(<= ~counter~0 7)} #86#return; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,471 INFO L290 TraceCheckUtils]: 118: Hoare triple {65731#(<= ~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); {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,472 INFO L290 TraceCheckUtils]: 119: Hoare triple {65731#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65731#(<= ~counter~0 7)} is VALID [2022-04-28 13:28:35,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {65731#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,473 INFO L290 TraceCheckUtils]: 121: Hoare triple {65774#(<= ~counter~0 8)} assume !!(#t~post6 < 100);havoc #t~post6; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,473 INFO L272 TraceCheckUtils]: 122: Hoare triple {65774#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,473 INFO L290 TraceCheckUtils]: 123: Hoare triple {65774#(<= ~counter~0 8)} ~cond := #in~cond; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {65774#(<= ~counter~0 8)} assume !(0 == ~cond); {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,474 INFO L290 TraceCheckUtils]: 125: Hoare triple {65774#(<= ~counter~0 8)} assume true; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,474 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {65774#(<= ~counter~0 8)} {65774#(<= ~counter~0 8)} #84#return; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,475 INFO L272 TraceCheckUtils]: 127: Hoare triple {65774#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,475 INFO L290 TraceCheckUtils]: 128: Hoare triple {65774#(<= ~counter~0 8)} ~cond := #in~cond; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,475 INFO L290 TraceCheckUtils]: 129: Hoare triple {65774#(<= ~counter~0 8)} assume !(0 == ~cond); {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,476 INFO L290 TraceCheckUtils]: 130: Hoare triple {65774#(<= ~counter~0 8)} assume true; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,476 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {65774#(<= ~counter~0 8)} {65774#(<= ~counter~0 8)} #86#return; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,476 INFO L290 TraceCheckUtils]: 132: Hoare triple {65774#(<= ~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); {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,477 INFO L290 TraceCheckUtils]: 133: Hoare triple {65774#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65774#(<= ~counter~0 8)} is VALID [2022-04-28 13:28:35,477 INFO L290 TraceCheckUtils]: 134: Hoare triple {65774#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,478 INFO L290 TraceCheckUtils]: 135: Hoare triple {65817#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,478 INFO L272 TraceCheckUtils]: 136: Hoare triple {65817#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,478 INFO L290 TraceCheckUtils]: 137: Hoare triple {65817#(<= ~counter~0 9)} ~cond := #in~cond; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,479 INFO L290 TraceCheckUtils]: 138: Hoare triple {65817#(<= ~counter~0 9)} assume !(0 == ~cond); {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,479 INFO L290 TraceCheckUtils]: 139: Hoare triple {65817#(<= ~counter~0 9)} assume true; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,479 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {65817#(<= ~counter~0 9)} {65817#(<= ~counter~0 9)} #84#return; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,480 INFO L272 TraceCheckUtils]: 141: Hoare triple {65817#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,480 INFO L290 TraceCheckUtils]: 142: Hoare triple {65817#(<= ~counter~0 9)} ~cond := #in~cond; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,480 INFO L290 TraceCheckUtils]: 143: Hoare triple {65817#(<= ~counter~0 9)} assume !(0 == ~cond); {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,481 INFO L290 TraceCheckUtils]: 144: Hoare triple {65817#(<= ~counter~0 9)} assume true; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,481 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {65817#(<= ~counter~0 9)} {65817#(<= ~counter~0 9)} #86#return; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,481 INFO L290 TraceCheckUtils]: 146: Hoare triple {65817#(<= ~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); {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,482 INFO L290 TraceCheckUtils]: 147: Hoare triple {65817#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65817#(<= ~counter~0 9)} is VALID [2022-04-28 13:28:35,483 INFO L290 TraceCheckUtils]: 148: Hoare triple {65817#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,483 INFO L290 TraceCheckUtils]: 149: Hoare triple {65860#(<= ~counter~0 10)} assume !!(#t~post6 < 100);havoc #t~post6; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,484 INFO L272 TraceCheckUtils]: 150: Hoare triple {65860#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,484 INFO L290 TraceCheckUtils]: 151: Hoare triple {65860#(<= ~counter~0 10)} ~cond := #in~cond; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,484 INFO L290 TraceCheckUtils]: 152: Hoare triple {65860#(<= ~counter~0 10)} assume !(0 == ~cond); {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,484 INFO L290 TraceCheckUtils]: 153: Hoare triple {65860#(<= ~counter~0 10)} assume true; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,485 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {65860#(<= ~counter~0 10)} {65860#(<= ~counter~0 10)} #84#return; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,485 INFO L272 TraceCheckUtils]: 155: Hoare triple {65860#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,486 INFO L290 TraceCheckUtils]: 156: Hoare triple {65860#(<= ~counter~0 10)} ~cond := #in~cond; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,486 INFO L290 TraceCheckUtils]: 157: Hoare triple {65860#(<= ~counter~0 10)} assume !(0 == ~cond); {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,486 INFO L290 TraceCheckUtils]: 158: Hoare triple {65860#(<= ~counter~0 10)} assume true; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,487 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {65860#(<= ~counter~0 10)} {65860#(<= ~counter~0 10)} #86#return; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,487 INFO L290 TraceCheckUtils]: 160: Hoare triple {65860#(<= ~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); {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,487 INFO L290 TraceCheckUtils]: 161: Hoare triple {65860#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65860#(<= ~counter~0 10)} is VALID [2022-04-28 13:28:35,488 INFO L290 TraceCheckUtils]: 162: Hoare triple {65860#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,488 INFO L290 TraceCheckUtils]: 163: Hoare triple {65903#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,489 INFO L272 TraceCheckUtils]: 164: Hoare triple {65903#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,489 INFO L290 TraceCheckUtils]: 165: Hoare triple {65903#(<= ~counter~0 11)} ~cond := #in~cond; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,489 INFO L290 TraceCheckUtils]: 166: Hoare triple {65903#(<= ~counter~0 11)} assume !(0 == ~cond); {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,489 INFO L290 TraceCheckUtils]: 167: Hoare triple {65903#(<= ~counter~0 11)} assume true; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,490 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {65903#(<= ~counter~0 11)} {65903#(<= ~counter~0 11)} #84#return; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,490 INFO L272 TraceCheckUtils]: 169: Hoare triple {65903#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,491 INFO L290 TraceCheckUtils]: 170: Hoare triple {65903#(<= ~counter~0 11)} ~cond := #in~cond; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,491 INFO L290 TraceCheckUtils]: 171: Hoare triple {65903#(<= ~counter~0 11)} assume !(0 == ~cond); {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,491 INFO L290 TraceCheckUtils]: 172: Hoare triple {65903#(<= ~counter~0 11)} assume true; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,492 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {65903#(<= ~counter~0 11)} {65903#(<= ~counter~0 11)} #86#return; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,492 INFO L290 TraceCheckUtils]: 174: Hoare triple {65903#(<= ~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); {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,492 INFO L290 TraceCheckUtils]: 175: Hoare triple {65903#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65903#(<= ~counter~0 11)} is VALID [2022-04-28 13:28:35,493 INFO L290 TraceCheckUtils]: 176: Hoare triple {65903#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,493 INFO L290 TraceCheckUtils]: 177: Hoare triple {65946#(<= ~counter~0 12)} assume !!(#t~post6 < 100);havoc #t~post6; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,494 INFO L272 TraceCheckUtils]: 178: Hoare triple {65946#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,494 INFO L290 TraceCheckUtils]: 179: Hoare triple {65946#(<= ~counter~0 12)} ~cond := #in~cond; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,494 INFO L290 TraceCheckUtils]: 180: Hoare triple {65946#(<= ~counter~0 12)} assume !(0 == ~cond); {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,494 INFO L290 TraceCheckUtils]: 181: Hoare triple {65946#(<= ~counter~0 12)} assume true; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,495 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {65946#(<= ~counter~0 12)} {65946#(<= ~counter~0 12)} #84#return; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,495 INFO L272 TraceCheckUtils]: 183: Hoare triple {65946#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,496 INFO L290 TraceCheckUtils]: 184: Hoare triple {65946#(<= ~counter~0 12)} ~cond := #in~cond; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,496 INFO L290 TraceCheckUtils]: 185: Hoare triple {65946#(<= ~counter~0 12)} assume !(0 == ~cond); {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,496 INFO L290 TraceCheckUtils]: 186: Hoare triple {65946#(<= ~counter~0 12)} assume true; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,497 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {65946#(<= ~counter~0 12)} {65946#(<= ~counter~0 12)} #86#return; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,497 INFO L290 TraceCheckUtils]: 188: Hoare triple {65946#(<= ~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); {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,497 INFO L290 TraceCheckUtils]: 189: Hoare triple {65946#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {65946#(<= ~counter~0 12)} is VALID [2022-04-28 13:28:35,497 INFO L290 TraceCheckUtils]: 190: Hoare triple {65946#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65989#(<= |main_#t~post6| 12)} is VALID [2022-04-28 13:28:35,498 INFO L290 TraceCheckUtils]: 191: Hoare triple {65989#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {65402#false} is VALID [2022-04-28 13:28:35,498 INFO L272 TraceCheckUtils]: 192: Hoare triple {65402#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {65402#false} is VALID [2022-04-28 13:28:35,498 INFO L290 TraceCheckUtils]: 193: Hoare triple {65402#false} ~cond := #in~cond; {65402#false} is VALID [2022-04-28 13:28:35,498 INFO L290 TraceCheckUtils]: 194: Hoare triple {65402#false} assume 0 == ~cond; {65402#false} is VALID [2022-04-28 13:28:35,498 INFO L290 TraceCheckUtils]: 195: Hoare triple {65402#false} assume !false; {65402#false} is VALID [2022-04-28 13:28:35,499 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-28 13:28:35,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:28:36,451 INFO L290 TraceCheckUtils]: 195: Hoare triple {65402#false} assume !false; {65402#false} is VALID [2022-04-28 13:28:36,451 INFO L290 TraceCheckUtils]: 194: Hoare triple {65402#false} assume 0 == ~cond; {65402#false} is VALID [2022-04-28 13:28:36,451 INFO L290 TraceCheckUtils]: 193: Hoare triple {65402#false} ~cond := #in~cond; {65402#false} is VALID [2022-04-28 13:28:36,451 INFO L272 TraceCheckUtils]: 192: Hoare triple {65402#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {65402#false} is VALID [2022-04-28 13:28:36,451 INFO L290 TraceCheckUtils]: 191: Hoare triple {66017#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {65402#false} is VALID [2022-04-28 13:28:36,452 INFO L290 TraceCheckUtils]: 190: Hoare triple {66021#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66017#(< |main_#t~post6| 100)} is VALID [2022-04-28 13:28:36,452 INFO L290 TraceCheckUtils]: 189: Hoare triple {66021#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66021#(< ~counter~0 100)} is VALID [2022-04-28 13:28:36,452 INFO L290 TraceCheckUtils]: 188: Hoare triple {66021#(< ~counter~0 100)} 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 100)} is VALID [2022-04-28 13:28:36,453 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {65401#true} {66021#(< ~counter~0 100)} #86#return; {66021#(< ~counter~0 100)} is VALID [2022-04-28 13:28:36,453 INFO L290 TraceCheckUtils]: 186: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,453 INFO L290 TraceCheckUtils]: 185: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,453 INFO L290 TraceCheckUtils]: 184: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,453 INFO L272 TraceCheckUtils]: 183: Hoare triple {66021#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,453 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {65401#true} {66021#(< ~counter~0 100)} #84#return; {66021#(< ~counter~0 100)} is VALID [2022-04-28 13:28:36,454 INFO L290 TraceCheckUtils]: 181: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,454 INFO L290 TraceCheckUtils]: 180: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,454 INFO L290 TraceCheckUtils]: 179: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,454 INFO L272 TraceCheckUtils]: 178: Hoare triple {66021#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,454 INFO L290 TraceCheckUtils]: 177: Hoare triple {66021#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {66021#(< ~counter~0 100)} is VALID [2022-04-28 13:28:36,455 INFO L290 TraceCheckUtils]: 176: Hoare triple {66064#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66021#(< ~counter~0 100)} is VALID [2022-04-28 13:28:36,455 INFO L290 TraceCheckUtils]: 175: Hoare triple {66064#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66064#(< ~counter~0 99)} is VALID [2022-04-28 13:28:36,456 INFO L290 TraceCheckUtils]: 174: Hoare triple {66064#(< ~counter~0 99)} 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 99)} is VALID [2022-04-28 13:28:36,456 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {65401#true} {66064#(< ~counter~0 99)} #86#return; {66064#(< ~counter~0 99)} is VALID [2022-04-28 13:28:36,456 INFO L290 TraceCheckUtils]: 172: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,456 INFO L290 TraceCheckUtils]: 171: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,456 INFO L290 TraceCheckUtils]: 170: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,456 INFO L272 TraceCheckUtils]: 169: Hoare triple {66064#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,457 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {65401#true} {66064#(< ~counter~0 99)} #84#return; {66064#(< ~counter~0 99)} is VALID [2022-04-28 13:28:36,457 INFO L290 TraceCheckUtils]: 167: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,457 INFO L290 TraceCheckUtils]: 166: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,457 INFO L290 TraceCheckUtils]: 165: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,457 INFO L272 TraceCheckUtils]: 164: Hoare triple {66064#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,457 INFO L290 TraceCheckUtils]: 163: Hoare triple {66064#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {66064#(< ~counter~0 99)} is VALID [2022-04-28 13:28:36,458 INFO L290 TraceCheckUtils]: 162: Hoare triple {66107#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66064#(< ~counter~0 99)} is VALID [2022-04-28 13:28:36,458 INFO L290 TraceCheckUtils]: 161: Hoare triple {66107#(< ~counter~0 98)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66107#(< ~counter~0 98)} is VALID [2022-04-28 13:28:36,459 INFO L290 TraceCheckUtils]: 160: Hoare triple {66107#(< ~counter~0 98)} 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 98)} is VALID [2022-04-28 13:28:36,459 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {65401#true} {66107#(< ~counter~0 98)} #86#return; {66107#(< ~counter~0 98)} is VALID [2022-04-28 13:28:36,459 INFO L290 TraceCheckUtils]: 158: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,459 INFO L290 TraceCheckUtils]: 157: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,459 INFO L290 TraceCheckUtils]: 156: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,459 INFO L272 TraceCheckUtils]: 155: Hoare triple {66107#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,460 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {65401#true} {66107#(< ~counter~0 98)} #84#return; {66107#(< ~counter~0 98)} is VALID [2022-04-28 13:28:36,460 INFO L290 TraceCheckUtils]: 153: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,460 INFO L290 TraceCheckUtils]: 152: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,460 INFO L290 TraceCheckUtils]: 151: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,460 INFO L272 TraceCheckUtils]: 150: Hoare triple {66107#(< ~counter~0 98)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,460 INFO L290 TraceCheckUtils]: 149: Hoare triple {66107#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {66107#(< ~counter~0 98)} is VALID [2022-04-28 13:28:36,461 INFO L290 TraceCheckUtils]: 148: Hoare triple {66150#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66107#(< ~counter~0 98)} is VALID [2022-04-28 13:28:36,461 INFO L290 TraceCheckUtils]: 147: Hoare triple {66150#(< ~counter~0 97)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66150#(< ~counter~0 97)} is VALID [2022-04-28 13:28:36,462 INFO L290 TraceCheckUtils]: 146: Hoare triple {66150#(< ~counter~0 97)} 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 97)} is VALID [2022-04-28 13:28:36,462 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {65401#true} {66150#(< ~counter~0 97)} #86#return; {66150#(< ~counter~0 97)} is VALID [2022-04-28 13:28:36,462 INFO L290 TraceCheckUtils]: 144: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,462 INFO L290 TraceCheckUtils]: 143: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,462 INFO L290 TraceCheckUtils]: 142: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,462 INFO L272 TraceCheckUtils]: 141: Hoare triple {66150#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,463 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {65401#true} {66150#(< ~counter~0 97)} #84#return; {66150#(< ~counter~0 97)} is VALID [2022-04-28 13:28:36,463 INFO L290 TraceCheckUtils]: 139: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,463 INFO L290 TraceCheckUtils]: 138: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,463 INFO L290 TraceCheckUtils]: 137: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,463 INFO L272 TraceCheckUtils]: 136: Hoare triple {66150#(< ~counter~0 97)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,463 INFO L290 TraceCheckUtils]: 135: Hoare triple {66150#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {66150#(< ~counter~0 97)} is VALID [2022-04-28 13:28:36,480 INFO L290 TraceCheckUtils]: 134: Hoare triple {66193#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66150#(< ~counter~0 97)} is VALID [2022-04-28 13:28:36,480 INFO L290 TraceCheckUtils]: 133: Hoare triple {66193#(< ~counter~0 96)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66193#(< ~counter~0 96)} is VALID [2022-04-28 13:28:36,495 INFO L290 TraceCheckUtils]: 132: Hoare triple {66193#(< ~counter~0 96)} 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 96)} is VALID [2022-04-28 13:28:36,496 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {65401#true} {66193#(< ~counter~0 96)} #86#return; {66193#(< ~counter~0 96)} is VALID [2022-04-28 13:28:36,496 INFO L290 TraceCheckUtils]: 130: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,496 INFO L290 TraceCheckUtils]: 129: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,496 INFO L290 TraceCheckUtils]: 128: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,496 INFO L272 TraceCheckUtils]: 127: Hoare triple {66193#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,497 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {65401#true} {66193#(< ~counter~0 96)} #84#return; {66193#(< ~counter~0 96)} is VALID [2022-04-28 13:28:36,497 INFO L290 TraceCheckUtils]: 125: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,497 INFO L290 TraceCheckUtils]: 124: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,497 INFO L290 TraceCheckUtils]: 123: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,497 INFO L272 TraceCheckUtils]: 122: Hoare triple {66193#(< ~counter~0 96)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,497 INFO L290 TraceCheckUtils]: 121: Hoare triple {66193#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {66193#(< ~counter~0 96)} is VALID [2022-04-28 13:28:36,498 INFO L290 TraceCheckUtils]: 120: Hoare triple {66236#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66193#(< ~counter~0 96)} is VALID [2022-04-28 13:28:36,498 INFO L290 TraceCheckUtils]: 119: Hoare triple {66236#(< ~counter~0 95)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,499 INFO L290 TraceCheckUtils]: 118: Hoare triple {66236#(< ~counter~0 95)} 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); {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,499 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {65401#true} {66236#(< ~counter~0 95)} #86#return; {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,499 INFO L290 TraceCheckUtils]: 116: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,499 INFO L290 TraceCheckUtils]: 115: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,499 INFO L290 TraceCheckUtils]: 114: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,499 INFO L272 TraceCheckUtils]: 113: Hoare triple {66236#(< ~counter~0 95)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,500 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {65401#true} {66236#(< ~counter~0 95)} #84#return; {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,500 INFO L290 TraceCheckUtils]: 111: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,500 INFO L272 TraceCheckUtils]: 108: Hoare triple {66236#(< ~counter~0 95)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,500 INFO L290 TraceCheckUtils]: 107: Hoare triple {66236#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,501 INFO L290 TraceCheckUtils]: 106: Hoare triple {66279#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66236#(< ~counter~0 95)} is VALID [2022-04-28 13:28:36,501 INFO L290 TraceCheckUtils]: 105: Hoare triple {66279#(< ~counter~0 94)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,501 INFO L290 TraceCheckUtils]: 104: Hoare triple {66279#(< ~counter~0 94)} 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); {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,502 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65401#true} {66279#(< ~counter~0 94)} #86#return; {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,502 INFO L290 TraceCheckUtils]: 102: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,502 INFO L290 TraceCheckUtils]: 101: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,502 INFO L290 TraceCheckUtils]: 100: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,502 INFO L272 TraceCheckUtils]: 99: Hoare triple {66279#(< ~counter~0 94)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,502 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {65401#true} {66279#(< ~counter~0 94)} #84#return; {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,502 INFO L290 TraceCheckUtils]: 97: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,503 INFO L272 TraceCheckUtils]: 94: Hoare triple {66279#(< ~counter~0 94)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,503 INFO L290 TraceCheckUtils]: 93: Hoare triple {66279#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {66322#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66279#(< ~counter~0 94)} is VALID [2022-04-28 13:28:36,504 INFO L290 TraceCheckUtils]: 91: Hoare triple {66322#(< ~counter~0 93)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {66322#(< ~counter~0 93)} 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); {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,504 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {65401#true} {66322#(< ~counter~0 93)} #86#return; {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 86: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L272 TraceCheckUtils]: 85: Hoare triple {66322#(< ~counter~0 93)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {65401#true} {66322#(< ~counter~0 93)} #84#return; {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 83: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 82: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L290 TraceCheckUtils]: 81: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,505 INFO L272 TraceCheckUtils]: 80: Hoare triple {66322#(< ~counter~0 93)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,506 INFO L290 TraceCheckUtils]: 79: Hoare triple {66322#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,506 INFO L290 TraceCheckUtils]: 78: Hoare triple {66365#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66322#(< ~counter~0 93)} is VALID [2022-04-28 13:28:36,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {66365#(< ~counter~0 92)} assume !(~r~0 >= ~d~0); {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,507 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {65401#true} {66365#(< ~counter~0 92)} #82#return; {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,507 INFO L272 TraceCheckUtils]: 72: Hoare triple {66365#(< ~counter~0 92)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65401#true} {66365#(< ~counter~0 92)} #80#return; {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L272 TraceCheckUtils]: 67: Hoare triple {66365#(< ~counter~0 92)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {65401#true} {66365#(< ~counter~0 92)} #78#return; {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,508 INFO L272 TraceCheckUtils]: 62: Hoare triple {66365#(< ~counter~0 92)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {66365#(< ~counter~0 92)} assume !!(#t~post5 < 100);havoc #t~post5; {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {66420#(< ~counter~0 91)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66365#(< ~counter~0 92)} is VALID [2022-04-28 13:28:36,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {66420#(< ~counter~0 91)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,510 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {65401#true} {66420#(< ~counter~0 91)} #82#return; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,510 INFO L272 TraceCheckUtils]: 54: Hoare triple {66420#(< ~counter~0 91)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,510 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {65401#true} {66420#(< ~counter~0 91)} #80#return; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 52: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L272 TraceCheckUtils]: 49: Hoare triple {66420#(< ~counter~0 91)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {65401#true} {66420#(< ~counter~0 91)} #78#return; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,511 INFO L272 TraceCheckUtils]: 44: Hoare triple {66420#(< ~counter~0 91)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {66420#(< ~counter~0 91)} assume !!(#t~post5 < 100);havoc #t~post5; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {66475#(< ~counter~0 90)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66420#(< ~counter~0 91)} is VALID [2022-04-28 13:28:36,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {66475#(< ~counter~0 90)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,513 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65401#true} {66475#(< ~counter~0 90)} #82#return; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,513 INFO L272 TraceCheckUtils]: 36: Hoare triple {66475#(< ~counter~0 90)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,513 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {65401#true} {66475#(< ~counter~0 90)} #80#return; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L272 TraceCheckUtils]: 31: Hoare triple {66475#(< ~counter~0 90)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {65401#true} {66475#(< ~counter~0 90)} #78#return; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,514 INFO L272 TraceCheckUtils]: 26: Hoare triple {66475#(< ~counter~0 90)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {66475#(< ~counter~0 90)} assume !!(#t~post5 < 100);havoc #t~post5; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {66530#(< ~counter~0 89)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66475#(< ~counter~0 90)} is VALID [2022-04-28 13:28:36,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {66530#(< ~counter~0 89)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,516 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65401#true} {66530#(< ~counter~0 89)} #82#return; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,516 INFO L272 TraceCheckUtils]: 18: Hoare triple {66530#(< ~counter~0 89)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,516 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {65401#true} {66530#(< ~counter~0 89)} #80#return; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L272 TraceCheckUtils]: 13: Hoare triple {66530#(< ~counter~0 89)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {65401#true} {66530#(< ~counter~0 89)} #78#return; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {65401#true} assume true; {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {65401#true} assume !(0 == ~cond); {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {65401#true} ~cond := #in~cond; {65401#true} is VALID [2022-04-28 13:28:36,517 INFO L272 TraceCheckUtils]: 8: Hoare triple {66530#(< ~counter~0 89)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {65401#true} is VALID [2022-04-28 13:28:36,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {66530#(< ~counter~0 89)} assume !!(#t~post5 < 100);havoc #t~post5; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {66585#(< ~counter~0 88)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {66530#(< ~counter~0 89)} is VALID [2022-04-28 13:28:36,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {66585#(< ~counter~0 88)} 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; {66585#(< ~counter~0 88)} is VALID [2022-04-28 13:28:36,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {66585#(< ~counter~0 88)} call #t~ret7 := main(); {66585#(< ~counter~0 88)} is VALID [2022-04-28 13:28:36,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66585#(< ~counter~0 88)} {65401#true} #92#return; {66585#(< ~counter~0 88)} is VALID [2022-04-28 13:28:36,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {66585#(< ~counter~0 88)} assume true; {66585#(< ~counter~0 88)} is VALID [2022-04-28 13:28:36,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {65401#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; {66585#(< ~counter~0 88)} is VALID [2022-04-28 13:28:36,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {65401#true} call ULTIMATE.init(); {65401#true} is VALID [2022-04-28 13:28:36,520 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-28 13:28:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:28:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859986365] [2022-04-28 13:28:36,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:28:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073191223] [2022-04-28 13:28:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073191223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:28:36,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:28:36,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-28 13:28:36,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:28:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902438563] [2022-04-28 13:28:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902438563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:28:36,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:28:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 13:28:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367758242] [2022-04-28 13:28:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:28:36,522 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-28 13:28:36,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:28:36,522 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-28 13:28:36,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 13:28:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 13:28:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-28 13:28:36,685 INFO L87 Difference]: Start difference. First operand 595 states and 670 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-28 13:28:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:38,945 INFO L93 Difference]: Finished difference Result 689 states and 782 transitions. [2022-04-28 13:28:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 13:28:38,945 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-28 13:28:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:28:38,945 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-28 13:28:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2022-04-28 13:28:38,947 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-28 13:28:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2022-04-28 13:28:38,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 272 transitions. [2022-04-28 13:28:39,179 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-28 13:28:39,198 INFO L225 Difference]: With dead ends: 689 [2022-04-28 13:28:39,199 INFO L226 Difference]: Without dead ends: 666 [2022-04-28 13:28:39,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=583, Invalid=823, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 13:28:39,199 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 153 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:28:39,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 324 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:28:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-04-28 13:28:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 665. [2022-04-28 13:28:40,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:28:40,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 13:28:40,217 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 13:28:40,217 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 13:28:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:40,231 INFO L93 Difference]: Finished difference Result 666 states and 752 transitions. [2022-04-28 13:28:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 752 transitions. [2022-04-28 13:28:40,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:40,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:40,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) Second operand 666 states. [2022-04-28 13:28:40,233 INFO L87 Difference]: Start difference. First operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) Second operand 666 states. [2022-04-28 13:28:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:28:40,247 INFO L93 Difference]: Finished difference Result 666 states and 752 transitions. [2022-04-28 13:28:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 752 transitions. [2022-04-28 13:28:40,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:28:40,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:28:40,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:28:40,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:28:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 450 states have (on average 1.0888888888888888) internal successors, (490), 464 states have internal predecessors, (490), 132 states have call successors, (132), 84 states have call predecessors, (132), 82 states have return successors, (129), 116 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-28 13:28:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 751 transitions. [2022-04-28 13:28:40,269 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 751 transitions. Word has length 196 [2022-04-28 13:28:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:28:40,277 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 751 transitions. [2022-04-28 13:28:40,278 INFO L496 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-28 13:28:40,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 665 states and 751 transitions. [2022-04-28 13:28:41,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:28:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 751 transitions. [2022-04-28 13:28:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-04-28 13:28:41,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:28:41,726 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:28:41,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 13:28:41,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:28:41,934 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:28:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:28:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1762259296, now seen corresponding path program 23 times [2022-04-28 13:28:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:28:41,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358110515]