/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:44:03,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:44:03,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:44:03,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:44:03,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:44:03,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:44:03,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:44:03,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:44:03,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:44:03,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:44:03,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:44:03,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:44:03,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:44:03,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:44:03,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:44:03,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:44:03,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:44:03,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:44:03,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:44:03,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:44:03,625 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:44:03,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:44:03,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:44:03,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:44:03,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:44:03,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:44:03,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:44:03,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:44:03,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:44:03,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:44:03,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:44:03,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:44:03,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:44:03,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:44:03,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:44:03,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:44:03,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:44:03,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:44:03,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:44:03,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:44:03,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:44:03,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:44:03,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:44:03,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:44:03,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:44:03,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:44:03,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:44:03,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:44:03,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:44:03,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:44:03,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:44:03,644 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:44:03,644 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-15 09:44:03,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:44:03,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:44:03,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:44:03,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:44:03,850 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:44:03,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c [2022-04-15 09:44:03,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a85bc2a/752f2b94419d4a628a76a132fe64e487/FLAG706b141a2 [2022-04-15 09:44:04,271 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:44:04,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c [2022-04-15 09:44:04,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a85bc2a/752f2b94419d4a628a76a132fe64e487/FLAG706b141a2 [2022-04-15 09:44:04,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a85bc2a/752f2b94419d4a628a76a132fe64e487 [2022-04-15 09:44:04,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:44:04,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:44:04,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:44:04,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:44:04,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:44:04,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6c4ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04, skipping insertion in model container [2022-04-15 09:44:04,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:44:04,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:44:04,444 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_unwindbound50.c[526,539] [2022-04-15 09:44:04,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:44:04,462 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:44:04,469 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_unwindbound50.c[526,539] [2022-04-15 09:44:04,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:44:04,486 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:44:04,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04 WrapperNode [2022-04-15 09:44:04,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:44:04,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:44:04,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:44:04,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:44:04,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:44:04,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:44:04,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:44:04,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:44:04,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (1/1) ... [2022-04-15 09:44:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:44:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:04,524 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-15 09:44:04,581 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-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:44:04,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:44:04,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:44:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:44:04,644 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:44:04,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:44:04,797 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:44:04,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:44:04,802 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 09:44:04,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:44:04 BoogieIcfgContainer [2022-04-15 09:44:04,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:44:04,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:44:04,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:44:04,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:44:04,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:44:04" (1/3) ... [2022-04-15 09:44:04,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e30db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:44:04, skipping insertion in model container [2022-04-15 09:44:04,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:44:04" (2/3) ... [2022-04-15 09:44:04,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e30db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:44:04, skipping insertion in model container [2022-04-15 09:44:04,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:44:04" (3/3) ... [2022-04-15 09:44:04,809 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound50.c [2022-04-15 09:44:04,813 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:44:04,813 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:44:04,855 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:44:04,859 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 09:44:04,860 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:44:04,873 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-15 09:44:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 09:44:04,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:04,878 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:04,879 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-15 09:44:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:04,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936958626] [2022-04-15 09:44:04,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-15 09:44:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:04,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173838933] [2022-04-15 09:44:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:44:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:05,009 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-15 09:44:05,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 09:44:05,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-15 09:44:05,011 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-15 09:44:05,011 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-15 09:44:05,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 09:44:05,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-15 09:44:05,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-15 09:44:05,012 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-15 09:44:05,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-15 09:44:05,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-15 09:44:05,012 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-15 09:44:05,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 09:44:05,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 09:44:05,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 09:44:05,013 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-15 09:44:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:05,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173838933] [2022-04-15 09:44:05,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173838933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:05,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:05,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:44:05,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:05,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936958626] [2022-04-15 09:44:05,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936958626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:05,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:05,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:44:05,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577277132] [2022-04-15 09:44:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:05,022 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-15 09:44:05,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:05,025 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-15 09:44:05,046 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-15 09:44:05,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 09:44:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:05,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 09:44:05,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:44:05,061 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-15 09:44:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,177 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-15 09:44:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 09:44:05,178 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-15 09:44:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:05,179 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-15 09:44:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-15 09:44:05,185 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-15 09:44:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-15 09:44:05,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-15 09:44:05,270 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-15 09:44:05,279 INFO L225 Difference]: With dead ends: 57 [2022-04-15 09:44:05,280 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 09:44:05,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:44:05,286 INFO L913 BasicCegarLoop]: 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-15 09:44:05,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 09:44:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 09:44:05,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:05,307 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-15 09:44:05,308 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-15 09:44:05,308 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-15 09:44:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,311 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-15 09:44:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-15 09:44:05,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:05,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:05,312 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-15 09:44:05,313 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-15 09:44:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,318 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-15 09:44:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-15 09:44:05,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:05,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:05,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:05,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:05,319 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-15 09:44:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-15 09:44:05,323 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-15 09:44:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:05,323 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-15 09:44:05,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:44:05,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-15 09:44:05,358 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-15 09:44:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-15 09:44:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 09:44:05,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:05,359 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:05,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 09:44:05,360 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-15 09:44:05,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:05,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [563627780] [2022-04-15 09:44:05,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-15 09:44:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681542764] [2022-04-15 09:44:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:05,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:44:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:05,478 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-15 09:44:05,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 09:44:05,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-15 09:44:05,480 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-15 09:44:05,481 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-15 09:44:05,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 09:44:05,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-15 09:44:05,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-15 09:44:05,484 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-15 09:44:05,484 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-15 09:44:05,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 50);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-15 09:44:05,486 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-15 09:44:05,487 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-15 09:44:05,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-15 09:44:05,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 09:44:05,487 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-15 09:44:05,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681542764] [2022-04-15 09:44:05,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681542764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:05,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:05,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:05,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:05,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [563627780] [2022-04-15 09:44:05,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [563627780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:05,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:05,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254781637] [2022-04-15 09:44:05,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:05,491 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-15 09:44:05,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:05,492 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-15 09:44:05,502 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-15 09:44:05,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:44:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:44:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:44:05,503 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-15 09:44:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,821 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-15 09:44:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:44:05,821 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-15 09:44:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:05,821 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-15 09:44:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-15 09:44:05,824 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-15 09:44:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-15 09:44:05,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-15 09:44:05,879 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-15 09:44:05,881 INFO L225 Difference]: With dead ends: 41 [2022-04-15 09:44:05,881 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 09:44:05,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:05,883 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:05,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:44:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 09:44:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-15 09:44:05,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:05,895 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-15 09:44:05,896 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-15 09:44:05,897 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-15 09:44:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,906 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 09:44:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 09:44:05,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:05,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:05,907 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-15 09:44:05,907 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-15 09:44:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:05,910 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 09:44:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 09:44:05,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:05,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:05,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:05,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:05,911 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-15 09:44:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-15 09:44:05,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-15 09:44:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:05,913 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-15 09:44:05,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:44:05,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-15 09:44:05,945 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-15 09:44:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-15 09:44:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 09:44:05,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:05,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:05,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 09:44:05,947 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-15 09:44:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:05,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840650457] [2022-04-15 09:44:05,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-15 09:44:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:05,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646066467] [2022-04-15 09:44:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:44:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,014 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-15 09:44:06,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:06,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:06,016 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-15 09:44:06,016 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-15 09:44:06,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:06,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:06,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:06,018 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-15 09:44:06,019 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-15 09:44:06,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {502#false} is VALID [2022-04-15 09:44:06,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-15 09:44:06,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 50);havoc #t~post6; {502#false} is VALID [2022-04-15 09:44:06,022 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-15 09:44:06,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-15 09:44:06,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-15 09:44:06,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-15 09:44:06,023 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-15 09:44:06,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:06,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646066467] [2022-04-15 09:44:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646066467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:44:06,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840650457] [2022-04-15 09:44:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840650457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:44:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421051320] [2022-04-15 09:44:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:06,025 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-15 09:44:06,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:06,026 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-15 09:44:06,035 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-15 09:44:06,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:44:06,036 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-15 09:44:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,181 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-15 09:44:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:44:06,182 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-15 09:44:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:06,182 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-15 09:44:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-15 09:44:06,184 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-15 09:44:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-15 09:44:06,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-15 09:44:06,226 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-15 09:44:06,227 INFO L225 Difference]: With dead ends: 46 [2022-04-15 09:44:06,227 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 09:44:06,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:44:06,229 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:06,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 09:44:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 09:44:06,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:06,237 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-15 09:44:06,237 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-15 09:44:06,238 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-15 09:44:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,239 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 09:44:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 09:44:06,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:06,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:06,240 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-15 09:44:06,241 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-15 09:44:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,242 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 09:44:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 09:44:06,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:06,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:06,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:06,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:06,243 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-15 09:44:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 09:44:06,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-15 09:44:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:06,245 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 09:44:06,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:44:06,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 09:44:06,275 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-15 09:44:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 09:44:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 09:44:06,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:06,276 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:06,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 09:44:06,276 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-15 09:44:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463183373] [2022-04-15 09:44:06,278 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-15 09:44:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:06,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074894959] [2022-04-15 09:44:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:44:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,327 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-15 09:44:06,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 09:44:06,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-15 09:44:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-15 09:44:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-15 09:44:06,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-15 09:44:06,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 09:44:06,333 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-15 09:44:06,334 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-15 09:44:06,334 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-15 09:44:06,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 09:44:06,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-15 09:44:06,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-15 09:44:06,335 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-15 09:44:06,335 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-15 09:44:06,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 50);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 09:44:06,336 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-15 09:44:06,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-15 09:44:06,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-15 09:44:06,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-15 09:44:06,337 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-15 09:44:06,337 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-15 09:44:06,337 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-15 09:44:06,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-15 09:44:06,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-15 09:44:06,338 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-15 09:44:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074894959] [2022-04-15 09:44:06,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074894959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:06,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463183373] [2022-04-15 09:44:06,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463183373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423771810] [2022-04-15 09:44:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:06,340 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-15 09:44:06,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:06,340 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-15 09:44:06,350 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-15 09:44:06,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:44:06,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:44:06,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:44:06,352 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-15 09:44:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,592 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-15 09:44:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:44:06,593 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-15 09:44:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:06,593 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-15 09:44:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-15 09:44:06,595 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-15 09:44:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-15 09:44:06,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-15 09:44:06,644 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-15 09:44:06,646 INFO L225 Difference]: With dead ends: 46 [2022-04-15 09:44:06,646 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 09:44:06,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:06,651 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:06,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:44:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 09:44:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-15 09:44:06,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:06,667 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-15 09:44:06,667 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-15 09:44:06,668 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-15 09:44:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,674 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-15 09:44:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-15 09:44:06,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:06,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:06,676 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-15 09:44:06,676 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-15 09:44:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:06,680 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-15 09:44:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-15 09:44:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:06,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:06,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:06,682 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-15 09:44:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-15 09:44:06,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-15 09:44:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:06,685 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-15 09:44:06,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:44:06,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-15 09:44:06,726 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-15 09:44:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-15 09:44:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 09:44:06,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:06,727 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:06,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 09:44:06,728 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-15 09:44:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:06,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524766958] [2022-04-15 09:44:06,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-15 09:44:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:06,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487481662] [2022-04-15 09:44:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:06,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:06,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418255073] [2022-04-15 09:44:06,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:06,764 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-15 09:44:06,765 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-15 09:44:06,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:06,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:06,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:44:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:06,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:06,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-15 09:44:06,987 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-15 09:44:06,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-15 09:44:06,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-15 09:44:06,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-15 09:44:06,988 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-15 09:44:06,988 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-15 09:44:06,989 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 < 50);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:44:06,989 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-15 09:44:06,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-15 09:44:06,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-15 09:44:06,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-15 09:44:06,990 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-15 09:44:06,990 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-15 09:44:06,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-15 09:44:06,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-15 09:44:06,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-15 09:44:06,991 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-15 09:44:06,992 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-15 09:44:06,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:06,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-15 09:44:06,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-15 09:44:06,993 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-15 09:44:06,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:44:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487481662] [2022-04-15 09:44:06,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418255073] [2022-04-15 09:44:06,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418255073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:06,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:06,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524766958] [2022-04-15 09:44:06,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524766958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:06,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959401633] [2022-04-15 09:44:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:06,995 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-15 09:44:06,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:06,995 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-15 09:44:07,009 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-15 09:44:07,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:07,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:44:07,010 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-15 09:44:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,233 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-15 09:44:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:44:07,233 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-15 09:44:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:07,233 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-15 09:44:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-15 09:44:07,235 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-15 09:44:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-15 09:44:07,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-15 09:44:07,300 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-15 09:44:07,301 INFO L225 Difference]: With dead ends: 65 [2022-04-15 09:44:07,301 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 09:44:07,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:44:07,302 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:07,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 09:44:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 09:44:07,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:07,313 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-15 09:44:07,314 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-15 09:44:07,314 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-15 09:44:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,316 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:44:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:44:07,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:07,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:07,317 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-15 09:44:07,317 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-15 09:44:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,319 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:44:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:44:07,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:07,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:07,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:07,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:07,320 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-15 09:44:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 09:44:07,321 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-15 09:44:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:07,322 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-15 09:44:07,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:44:07,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-15 09:44:07,370 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-15 09:44:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:44:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 09:44:07,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:07,371 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:07,406 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-15 09:44:07,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:07,588 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-15 09:44:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359711687] [2022-04-15 09:44:07,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-15 09:44:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218947834] [2022-04-15 09:44:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:07,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638368264] [2022-04-15 09:44:07,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:07,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:07,620 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-15 09:44:07,621 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-15 09:44:07,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:07,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:07,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:44:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:07,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:07,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-15 09:44:07,807 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-15 09:44:07,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:07,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:07,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:07,809 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-15 09:44:07,809 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-15 09:44:07,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,810 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-15 09:44:07,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,811 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,812 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-15 09:44:07,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,814 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-15 09:44:07,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:07,816 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-15 09:44:07,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1411#false} is VALID [2022-04-15 09:44:07,817 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-15 09:44:07,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-15 09:44:07,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-15 09:44:07,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-15 09:44:07,817 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-15 09:44:07,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:44:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218947834] [2022-04-15 09:44:07,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638368264] [2022-04-15 09:44:07,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638368264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:07,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:07,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:07,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:07,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359711687] [2022-04-15 09:44:07,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359711687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:07,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:07,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082482814] [2022-04-15 09:44:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:07,819 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-15 09:44:07,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:07,819 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-15 09:44:07,834 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-15 09:44:07,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:44:07,835 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-15 09:44:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,922 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-15 09:44:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:44:07,923 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-15 09:44:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:07,923 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-15 09:44:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:44:07,924 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-15 09:44:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:44:07,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-15 09:44:07,961 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-15 09:44:07,963 INFO L225 Difference]: With dead ends: 70 [2022-04-15 09:44:07,963 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 09:44:07,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:44:07,964 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:07,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 09:44:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-15 09:44:07,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:07,988 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-15 09:44:07,988 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-15 09:44:07,988 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-15 09:44:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,990 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 09:44:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 09:44:07,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:07,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:07,991 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-15 09:44:07,991 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-15 09:44:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:07,993 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-15 09:44:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-15 09:44:07,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:07,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:07,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:07,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:07,993 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-15 09:44:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-15 09:44:07,995 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-15 09:44:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:07,995 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-15 09:44:07,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:44:07,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-15 09:44:08,052 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-15 09:44:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-15 09:44:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 09:44:08,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:08,053 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:08,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 09:44:08,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 09:44:08,287 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-15 09:44:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:08,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2140388917] [2022-04-15 09:44:08,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:44:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-15 09:44:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:08,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900699885] [2022-04-15 09:44:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:08,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:08,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23986384] [2022-04-15 09:44:08,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:08,298 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-15 09:44:08,299 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-15 09:44:08,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:08,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:08,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:44:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:08,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:08,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-15 09:44:08,445 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-15 09:44:08,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-15 09:44:08,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-15 09:44:08,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-15 09:44:08,446 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-15 09:44:08,446 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-15 09:44:08,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:44:08,447 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-15 09:44:08,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-15 09:44:08,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-15 09:44:08,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-15 09:44:08,448 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-15 09:44:08,448 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-15 09:44:08,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-15 09:44:08,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-15 09:44:08,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-15 09:44:08,449 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-15 09:44:08,449 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-15 09:44:08,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-15 09:44:08,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-15 09:44:08,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-15 09:44:08,450 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-15 09:44:08,450 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-15 09:44:08,450 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-15 09:44:08,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:44:08,452 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-15 09:44:08,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:08,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-15 09:44:08,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-15 09:44:08,453 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-15 09:44:08,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:44:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900699885] [2022-04-15 09:44:08,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23986384] [2022-04-15 09:44:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23986384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:08,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:08,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2140388917] [2022-04-15 09:44:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2140388917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:08,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223508034] [2022-04-15 09:44:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:08,454 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-15 09:44:08,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:08,454 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-15 09:44:08,469 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-15 09:44:08,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:44:08,470 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-15 09:44:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:08,624 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-15 09:44:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:44:08,624 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-15 09:44:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:08,624 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-15 09:44:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 09:44:08,625 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-15 09:44:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 09:44:08,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-15 09:44:08,660 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-15 09:44:08,661 INFO L225 Difference]: With dead ends: 76 [2022-04-15 09:44:08,661 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 09:44:08,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:44:08,662 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:08,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 09:44:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-15 09:44:08,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:08,712 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-15 09:44:08,712 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-15 09:44:08,712 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-15 09:44:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:08,714 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 09:44:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 09:44:08,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:08,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:08,715 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-15 09:44:08,715 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-15 09:44:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:08,717 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 09:44:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 09:44:08,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:08,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:08,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:08,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:08,717 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-15 09:44:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-15 09:44:08,719 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-15 09:44:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:08,719 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-15 09:44:08,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:44:08,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-15 09:44:08,779 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-15 09:44:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-15 09:44:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 09:44:08,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:08,780 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:08,798 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-15 09:44:08,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:08,988 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-15 09:44:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:08,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941549384] [2022-04-15 09:44:12,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:12,789 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:12,789 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-15 09:44:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:12,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301478628] [2022-04-15 09:44:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:12,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:12,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:12,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854991120] [2022-04-15 09:44:12,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:12,827 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-15 09:44:12,828 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-15 09:44:12,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:12,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:12,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:44:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:12,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:13,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-15 09:44:13,014 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-15 09:44:13,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:13,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:13,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:13,016 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-15 09:44:13,016 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-15 09:44:13,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,017 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-15 09:44:13,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,019 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-15 09:44:13,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,021 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,021 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-15 09:44:13,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,023 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:13,023 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-15 09:44:13,024 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-15 09:44:13,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {2397#false} is VALID [2022-04-15 09:44:13,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-15 09:44:13,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 50);havoc #t~post6; {2397#false} is VALID [2022-04-15 09:44:13,024 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-15 09:44:13,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-15 09:44:13,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-15 09:44:13,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-15 09:44:13,025 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-15 09:44:13,025 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-15 09:44:13,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-15 09:44:13,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-15 09:44:13,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-15 09:44:13,025 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-15 09:44:13,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-15 09:44:13,173 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-15 09:44:13,173 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-15 09:44:13,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-15 09:44:13,173 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-15 09:44:13,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 50);havoc #t~post6; {2397#false} is VALID [2022-04-15 09:44:13,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-15 09:44:13,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2397#false} is VALID [2022-04-15 09:44:13,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:44:13,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,178 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #82#return; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-15 09:44:13,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-15 09:44:13,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-15 09:44:13,178 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-15 09:44:13,179 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #80#return; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-15 09:44:13,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-15 09:44:13,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-15 09:44:13,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-15 09:44:13,180 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #78#return; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-15 09:44:13,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-15 09:44:13,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-15 09:44:13,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-15 09:44:13,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 50)} is VALID [2022-04-15 09:44:13,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 49)} 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 49)} is VALID [2022-04-15 09:44:13,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 49)} call #t~ret7 := main(); {2604#(< ~counter~0 49)} is VALID [2022-04-15 09:44:13,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 49)} {2396#true} #92#return; {2604#(< ~counter~0 49)} is VALID [2022-04-15 09:44:13,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 49)} assume true; {2604#(< ~counter~0 49)} is VALID [2022-04-15 09:44:13,182 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 49)} is VALID [2022-04-15 09:44:13,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-15 09:44:13,183 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-15 09:44:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301478628] [2022-04-15 09:44:13,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854991120] [2022-04-15 09:44:13,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854991120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:44:13,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:44:13,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 09:44:13,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941549384] [2022-04-15 09:44:13,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941549384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423356194] [2022-04-15 09:44:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:13,184 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-15 09:44:13,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:13,184 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-15 09:44:13,201 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-15 09:44:13,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:44:13,202 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-15 09:44:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:13,304 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-15 09:44:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:44:13,304 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-15 09:44:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:13,305 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-15 09:44:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 09:44:13,306 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-15 09:44:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-15 09:44:13,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-15 09:44:13,345 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-15 09:44:13,346 INFO L225 Difference]: With dead ends: 90 [2022-04-15 09:44:13,346 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 09:44:13,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:44:13,347 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:13,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 09:44:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 09:44:13,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:13,382 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-15 09:44:13,382 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-15 09:44:13,382 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-15 09:44:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:13,384 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 09:44:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-15 09:44:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:13,385 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-15 09:44:13,385 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-15 09:44:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:13,387 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 09:44:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-15 09:44:13,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:13,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:13,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:13,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:13,388 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-15 09:44:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-15 09:44:13,389 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-15 09:44:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:13,390 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-15 09:44:13,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:44:13,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-15 09:44:13,447 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-15 09:44:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-15 09:44:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 09:44:13,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:13,448 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:13,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 09:44:13,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:13,686 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-15 09:44:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:13,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573360769] [2022-04-15 09:44:16,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:16,716 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:16,716 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-15 09:44:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:16,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569663816] [2022-04-15 09:44:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:16,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:16,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478863147] [2022-04-15 09:44:16,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:16,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:16,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:16,727 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-15 09:44:16,728 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-15 09:44:16,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:16,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:16,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:44:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:16,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:16,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-15 09:44:16,976 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-15 09:44:16,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-15 09:44:16,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-15 09:44:16,977 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-15 09:44:16,977 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-15 09:44:16,977 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 < 50);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 09:44:16,978 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-15 09:44:16,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:16,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:16,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,978 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-15 09:44:16,978 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-15 09:44:16,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:16,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:16,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,986 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-15 09:44:16,986 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-15 09:44:16,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:16,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:16,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,991 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-15 09:44:16,992 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-15 09:44:16,994 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-15 09:44:16,994 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 < 50);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 09:44:16,994 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-15 09:44:16,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:16,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:16,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,996 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-15 09:44:16,996 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-15 09:44:16,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:16,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:16,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:16,997 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-15 09:44:16,997 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-15 09:44:16,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:16,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-15 09:44:16,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-15 09:44:16,998 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-15 09:44:16,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:17,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-15 09:44:17,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-15 09:44:17,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:17,205 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-15 09:44:17,205 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-15 09:44:17,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:17,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:17,205 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-15 09:44:17,206 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-15 09:44:17,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:17,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:17,206 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-15 09:44:17,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 09:44:17,207 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-15 09:44:17,209 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-15 09:44:17,210 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-15 09:44:17,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:17,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:17,211 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-15 09:44:17,211 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-15 09:44:17,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:17,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:17,212 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-15 09:44:17,213 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-15 09:44:17,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-15 09:44:17,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-15 09:44:17,213 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-15 09:44:17,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 09:44:17,214 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-15 09:44:17,214 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-15 09:44:17,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-15 09:44:17,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-15 09:44:17,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 09:44:17,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-15 09:44:17,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-15 09:44:17,217 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-15 09:44:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569663816] [2022-04-15 09:44:17,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478863147] [2022-04-15 09:44:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478863147] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 09:44:17,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:44:17,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 09:44:17,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:17,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573360769] [2022-04-15 09:44:17,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573360769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:17,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:17,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:44:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294242877] [2022-04-15 09:44:17,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:17,219 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-15 09:44:17,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:17,220 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-15 09:44:17,235 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-15 09:44:17,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:44:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:44:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 09:44:17,236 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-15 09:44:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:19,461 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-15 09:44:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:44:19,462 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-15 09:44:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:19,462 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-15 09:44:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 09:44:19,464 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-15 09:44:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 09:44:19,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-15 09:44:19,540 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-15 09:44:19,542 INFO L225 Difference]: With dead ends: 78 [2022-04-15 09:44:19,542 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 09:44:19,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:44:19,544 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:19,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 09:44:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-15 09:44:19,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:19,589 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-15 09:44:19,590 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-15 09:44:19,591 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-15 09:44:19,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:19,593 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-15 09:44:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-15 09:44:19,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:19,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:19,594 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-15 09:44:19,594 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-15 09:44:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:19,595 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-15 09:44:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-15 09:44:19,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:19,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:19,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:19,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:19,596 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-15 09:44:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-15 09:44:19,598 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-15 09:44:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:19,598 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-15 09:44:19,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:44:19,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-15 09:44:19,668 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-15 09:44:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-15 09:44:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 09:44:19,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:19,670 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:19,688 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-15 09:44:19,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:19,884 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-15 09:44:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:19,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403055301] [2022-04-15 09:44:22,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:22,002 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:22,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-15 09:44:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:22,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125029015] [2022-04-15 09:44:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:22,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:22,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401764569] [2022-04-15 09:44:22,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:22,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:22,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:22,024 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-15 09:44:22,025 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-15 09:44:22,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:22,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:22,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:44:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:22,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-15 09:44:22,279 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-15 09:44:22,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:22,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:22,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:22,282 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-15 09:44:22,283 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-15 09:44:22,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,283 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-15 09:44:22,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,284 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,285 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-15 09:44:22,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,286 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,287 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-15 09:44:22,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,289 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:22,289 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-15 09:44:22,289 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-15 09:44:22,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,292 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-15 09:44:22,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,293 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,294 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-15 09:44:22,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,295 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,296 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-15 09:44:22,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,301 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:22,302 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-15 09:44:22,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3770#false} is VALID [2022-04-15 09:44:22,302 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-15 09:44:22,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-15 09:44:22,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-15 09:44:22,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-15 09:44:22,302 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-15 09:44:22,302 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-15 09:44:22,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-15 09:44:22,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-15 09:44:22,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-15 09:44:22,303 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-15 09:44:22,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:22,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-15 09:44:22,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-15 09:44:22,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-15 09:44:22,522 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-15 09:44:22,522 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-15 09:44:22,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,522 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-15 09:44:22,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3770#false} is VALID [2022-04-15 09:44:22,523 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:44:22,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 50)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,524 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #82#return; {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,525 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,528 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #80#return; {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,528 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,529 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #78#return; {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,529 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 50)} is VALID [2022-04-15 09:44:22,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,533 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #82#return; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,533 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #80#return; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #78#return; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-15 09:44:22,534 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-15 09:44:22,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 49)} is VALID [2022-04-15 09:44:22,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(< ~counter~0 48)} 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 48)} is VALID [2022-04-15 09:44:22,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 48)} call #t~ret7 := main(); {4075#(< ~counter~0 48)} is VALID [2022-04-15 09:44:22,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 48)} {3769#true} #92#return; {4075#(< ~counter~0 48)} is VALID [2022-04-15 09:44:22,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 48)} assume true; {4075#(< ~counter~0 48)} is VALID [2022-04-15 09:44:22,537 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 48)} is VALID [2022-04-15 09:44:22,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-15 09:44:22,537 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-15 09:44:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:22,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125029015] [2022-04-15 09:44:22,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:22,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401764569] [2022-04-15 09:44:22,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401764569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:44:22,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:44:22,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:44:22,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403055301] [2022-04-15 09:44:22,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403055301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:22,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:22,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566868672] [2022-04-15 09:44:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:22,538 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-15 09:44:22,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:22,539 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-15 09:44:22,563 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-15 09:44:22,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:44:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:44:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:22,563 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-15 09:44:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:22,724 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-15 09:44:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:44:22,724 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-15 09:44:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:22,724 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-15 09:44:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-15 09:44:22,725 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-15 09:44:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-15 09:44:22,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-15 09:44:22,769 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-15 09:44:22,770 INFO L225 Difference]: With dead ends: 104 [2022-04-15 09:44:22,770 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 09:44:22,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:22,771 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:22,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 09:44:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-15 09:44:22,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:22,836 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-15 09:44:22,837 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-15 09:44:22,837 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-15 09:44:22,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:22,838 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-15 09:44:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-15 09:44:22,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:22,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:22,839 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-15 09:44:22,839 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-15 09:44:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:22,841 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-15 09:44:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-15 09:44:22,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:22,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:22,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:22,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:22,841 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-15 09:44:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-15 09:44:22,843 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-15 09:44:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:22,843 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-15 09:44:22,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-15 09:44:22,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-15 09:44:22,929 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-15 09:44:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-15 09:44:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 09:44:22,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:22,930 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:22,946 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-15 09:44:23,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:23,130 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-15 09:44:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:23,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835009966] [2022-04-15 09:44:25,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:25,578 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:25,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-15 09:44:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:25,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529748208] [2022-04-15 09:44:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:25,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244560829] [2022-04-15 09:44:25,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:44:25,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:25,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:25,606 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-15 09:44:25,607 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-15 09:44:25,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:44:25,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:25,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:44:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:25,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:25,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-15 09:44:25,880 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-15 09:44:25,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:25,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:25,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:25,881 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-15 09:44:25,882 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-15 09:44:25,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,882 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-15 09:44:25,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,884 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,884 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-15 09:44:25,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,885 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,886 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-15 09:44:25,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,887 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:25,887 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-15 09:44:25,888 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-15 09:44:25,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,888 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-15 09:44:25,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,890 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,890 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-15 09:44:25,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,891 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,892 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-15 09:44:25,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,893 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:25,893 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-15 09:44:25,894 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-15 09:44:25,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 50);havoc #t~post5; {4671#false} is VALID [2022-04-15 09:44:25,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-15 09:44:25,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 50);havoc #t~post6; {4671#false} is VALID [2022-04-15 09:44:25,894 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-15 09:44:25,894 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-15 09:44:25,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-15 09:44:25,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-15 09:44:25,895 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-15 09:44:25,895 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-15 09:44:25,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-15 09:44:25,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-15 09:44:25,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-15 09:44:25,895 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-15 09:44:25,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-15 09:44:26,097 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-15 09:44:26,097 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,097 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-15 09:44:26,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 50);havoc #t~post6; {4671#false} is VALID [2022-04-15 09:44:26,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-15 09:44:26,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {4671#false} is VALID [2022-04-15 09:44:26,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4874#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:44:26,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,099 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #82#return; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,099 INFO L272 TraceCheckUtils]: 36: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,100 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #80#return; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,100 INFO L272 TraceCheckUtils]: 31: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,100 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #78#return; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,101 INFO L272 TraceCheckUtils]: 26: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {4878#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4878#(< ~counter~0 50)} is VALID [2022-04-15 09:44:26,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {4933#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,102 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #82#return; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,103 INFO L272 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,103 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #80#return; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,104 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #78#return; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-15 09:44:26,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-15 09:44:26,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-15 09:44:26,104 INFO L272 TraceCheckUtils]: 8: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-15 09:44:26,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {4933#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(< ~counter~0 49)} is VALID [2022-04-15 09:44:26,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(< ~counter~0 48)} 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 48)} is VALID [2022-04-15 09:44:26,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 48)} call #t~ret7 := main(); {4988#(< ~counter~0 48)} is VALID [2022-04-15 09:44:26,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 48)} {4670#true} #92#return; {4988#(< ~counter~0 48)} is VALID [2022-04-15 09:44:26,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 48)} assume true; {4988#(< ~counter~0 48)} is VALID [2022-04-15 09:44:26,106 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 48)} is VALID [2022-04-15 09:44:26,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-15 09:44:26,107 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-15 09:44:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529748208] [2022-04-15 09:44:26,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244560829] [2022-04-15 09:44:26,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244560829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:44:26,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:44:26,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:44:26,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:26,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835009966] [2022-04-15 09:44:26,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835009966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:26,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:26,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:44:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436883348] [2022-04-15 09:44:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:26,108 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-15 09:44:26,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:26,108 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-15 09:44:26,152 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-15 09:44:26,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:44:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:44:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:26,152 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-15 09:44:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:26,280 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-15 09:44:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:44:26,280 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-15 09:44:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:26,281 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-15 09:44:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-15 09:44:26,283 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-15 09:44:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-15 09:44:26,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-15 09:44:26,339 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-15 09:44:26,342 INFO L225 Difference]: With dead ends: 126 [2022-04-15 09:44:26,342 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 09:44:26,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:44:26,343 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:26,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:44:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 09:44:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-15 09:44:26,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:26,407 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-15 09:44:26,407 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-15 09:44:26,407 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-15 09:44:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:26,408 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-15 09:44:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-15 09:44:26,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:26,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:26,409 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-15 09:44:26,409 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-15 09:44:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:26,411 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-15 09:44:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-15 09:44:26,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:26,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:26,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:26,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:26,411 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-15 09:44:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-15 09:44:26,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-15 09:44:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:26,413 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-15 09:44:26,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-15 09:44:26,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-15 09:44:26,503 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-15 09:44:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-15 09:44:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 09:44:26,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:26,504 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:26,526 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-15 09:44:26,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:26,705 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-15 09:44:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:26,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [809082267] [2022-04-15 09:44:30,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:30,586 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:30,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-15 09:44:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:30,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230970905] [2022-04-15 09:44:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:30,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:30,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304412698] [2022-04-15 09:44:30,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:30,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:30,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:30,596 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-15 09:44:30,597 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-15 09:44:30,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:30,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:30,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:44:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:30,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:30,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-15 09:44:30,906 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-15 09:44:30,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:30,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:30,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-15 09:44:30,907 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-15 09:44:30,908 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-15 09:44:30,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,908 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-15 09:44:30,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,910 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,910 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-15 09:44:30,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,911 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,912 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-15 09:44:30,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,913 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-15 09:44:30,913 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-15 09:44:30,914 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-15 09:44:30,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,914 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-15 09:44:30,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,916 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,916 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-15 09:44:30,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,917 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,918 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-15 09:44:30,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,919 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-15 09:44:30,920 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-15 09:44:30,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {5771#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,921 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-15 09:44:30,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,922 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,923 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-15 09:44:30,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,924 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-15 09:44:30,924 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-15 09:44:30,925 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-15 09:44:30,925 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-15 09:44:30,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {5638#false} is VALID [2022-04-15 09:44:30,925 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-15 09:44:30,925 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-15 09:44:30,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-15 09:44:30,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-15 09:44:30,926 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-15 09:44:30,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:31,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-15 09:44:31,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-15 09:44:31,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-15 09:44:31,206 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-15 09:44:31,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {5638#false} is VALID [2022-04-15 09:44:31,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {5846#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5842#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:44:31,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {5846#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5846#(< ~counter~0 50)} is VALID [2022-04-15 09:44:31,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {5846#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 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 50)} is VALID [2022-04-15 09:44:31,208 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 50)} #86#return; {5846#(< ~counter~0 50)} is VALID [2022-04-15 09:44:31,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,208 INFO L272 TraceCheckUtils]: 49: Hoare triple {5846#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,209 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 50)} #84#return; {5846#(< ~counter~0 50)} is VALID [2022-04-15 09:44:31,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,209 INFO L272 TraceCheckUtils]: 44: Hoare triple {5846#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {5846#(< ~counter~0 50)} is VALID [2022-04-15 09:44:31,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 50)} is VALID [2022-04-15 09:44:31,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 49)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,211 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #82#return; {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,211 INFO L272 TraceCheckUtils]: 36: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,211 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #80#return; {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L272 TraceCheckUtils]: 31: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #78#return; {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,212 INFO L272 TraceCheckUtils]: 26: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {5889#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5889#(< ~counter~0 49)} is VALID [2022-04-15 09:44:31,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,214 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #82#return; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,214 INFO L272 TraceCheckUtils]: 18: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,215 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #80#return; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,215 INFO L272 TraceCheckUtils]: 13: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,215 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #78#return; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 09:44:31,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-15 09:44:31,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-15 09:44:31,216 INFO L272 TraceCheckUtils]: 8: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-15 09:44:31,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {5944#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {5999#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5944#(< ~counter~0 48)} is VALID [2022-04-15 09:44:31,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {5999#(< ~counter~0 47)} 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 47)} is VALID [2022-04-15 09:44:31,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 47)} call #t~ret7 := main(); {5999#(< ~counter~0 47)} is VALID [2022-04-15 09:44:31,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 47)} {5637#true} #92#return; {5999#(< ~counter~0 47)} is VALID [2022-04-15 09:44:31,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 47)} assume true; {5999#(< ~counter~0 47)} is VALID [2022-04-15 09:44:31,218 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 47)} is VALID [2022-04-15 09:44:31,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-15 09:44:31,218 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-15 09:44:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230970905] [2022-04-15 09:44:31,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:31,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304412698] [2022-04-15 09:44:31,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304412698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:44:31,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:44:31,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:44:31,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:31,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [809082267] [2022-04-15 09:44:31,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [809082267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:31,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:31,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:44:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829462031] [2022-04-15 09:44:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:31,220 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-15 09:44:31,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:31,220 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-15 09:44:31,261 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-15 09:44:31,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:44:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:44:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:44:31,262 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-15 09:44:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:31,549 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-15 09:44:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:44:31,549 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-15 09:44:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:31,549 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-15 09:44:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:44:31,550 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-15 09:44:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:44:31,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 09:44:31,613 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-15 09:44:31,615 INFO L225 Difference]: With dead ends: 145 [2022-04-15 09:44:31,615 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 09:44:31,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 09:44:31,616 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:31,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:44:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 09:44:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-15 09:44:31,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:31,697 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-15 09:44:31,697 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-15 09:44:31,698 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-15 09:44:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:31,700 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-15 09:44:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-15 09:44:31,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:31,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:31,700 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-15 09:44:31,701 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-15 09:44:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:31,703 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-15 09:44:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-15 09:44:31,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:31,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:31,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:31,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:31,703 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-15 09:44:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-15 09:44:31,705 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-15 09:44:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:31,706 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-15 09:44:31,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:44:31,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-15 09:44:31,845 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-15 09:44:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-15 09:44:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 09:44:31,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:31,846 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:31,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 09:44:32,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 09:44:32,047 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-15 09:44:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:32,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454457630] [2022-04-15 09:44:35,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:35,502 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:35,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-15 09:44:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:35,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786195588] [2022-04-15 09:44:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:35,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938998008] [2022-04-15 09:44:35,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:44:35,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:35,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:35,524 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-15 09:44:35,532 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-15 09:44:35,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:44:35,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:35,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:44:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:35,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:36,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-15 09:44:36,076 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-15 09:44:36,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-15 09:44:36,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-15 09:44:36,077 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-15 09:44:36,077 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-15 09:44:36,077 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 < 50);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-15 09:44:36,078 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-15 09:44:36,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,078 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-15 09:44:36,078 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-15 09:44:36,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,079 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-15 09:44:36,079 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-15 09:44:36,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,080 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-15 09:44:36,081 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-15 09:44:36,081 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-15 09:44:36,082 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 < 50);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-15 09:44:36,082 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-15 09:44:36,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,082 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-15 09:44:36,083 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-15 09:44:36,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,083 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-15 09:44:36,083 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-15 09:44:36,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,084 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-15 09:44:36,085 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-15 09:44:36,085 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-15 09:44:36,085 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 < 50);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-15 09:44:36,086 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-15 09:44:36,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,086 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-15 09:44:36,086 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-15 09:44:36,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:36,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:36,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:36,087 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-15 09:44:36,088 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-15 09:44:36,088 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-15 09:44:36,089 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-15 09:44:36,089 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 < 50);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-15 09:44:36,090 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-15 09:44:36,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:36,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-15 09:44:36,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-15 09:44:36,091 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-15 09:44:36,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:44:37,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-15 09:44:37,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-15 09:44:37,136 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:37,137 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-15 09:44:37,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:44:37,137 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-15 09:44:37,150 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-15 09:44:37,168 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-15 09:44:37,169 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-15 09:44:37,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,170 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-15 09:44:37,170 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-15 09:44:37,170 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,170 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-15 09:44:37,171 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 < 50);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-15 09:44:37,172 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-15 09:44:37,173 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-15 09:44:37,174 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-15 09:44:37,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,174 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-15 09:44:37,175 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-15 09:44:37,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,175 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-15 09:44:37,176 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-15 09:44:37,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,176 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-15 09:44:37,177 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 < 50);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-15 09:44:37,178 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-15 09:44:37,185 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-15 09:44:37,186 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-15 09:44:37,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,186 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-15 09:44:37,187 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-15 09:44:37,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,187 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-15 09:44:37,188 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-15 09:44:37,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-15 09:44:37,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-15 09:44:37,188 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-15 09:44:37,188 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 < 50);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-15 09:44:37,189 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-15 09:44:37,189 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-15 09:44:37,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-15 09:44:37,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-15 09:44:37,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-15 09:44:37,189 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-15 09:44:37,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-15 09:44:37,190 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-15 09:44:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:44:37,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786195588] [2022-04-15 09:44:37,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:44:37,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938998008] [2022-04-15 09:44:37,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938998008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:44:37,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:44:37,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-15 09:44:37,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:44:37,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454457630] [2022-04-15 09:44:37,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454457630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:44:37,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:44:37,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:44:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469412407] [2022-04-15 09:44:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:44:37,191 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-15 09:44:37,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:44:37,192 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-15 09:44:37,225 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-15 09:44:37,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:44:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:44:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:44:37,226 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-15 09:44:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:37,774 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-15 09:44:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 09:44:37,775 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-15 09:44:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:44:37,775 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-15 09:44:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-15 09:44:37,776 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-15 09:44:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-15 09:44:37,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-15 09:44:37,869 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-15 09:44:37,871 INFO L225 Difference]: With dead ends: 181 [2022-04-15 09:44:37,871 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 09:44:37,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:44:37,872 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:44:37,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:44:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 09:44:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 09:44:37,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:44:37,933 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-15 09:44:37,933 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-15 09:44:37,934 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-15 09:44:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:37,938 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-15 09:44:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-15 09:44:37,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:37,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:37,939 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-15 09:44:37,939 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-15 09:44:37,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:44:37,942 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-15 09:44:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-15 09:44:37,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:44:37,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:44:37,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:44:37,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:44:37,943 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-15 09:44:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-15 09:44:37,948 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-15 09:44:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:44:37,948 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-15 09:44:37,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 09:44:37,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-15 09:44:38,055 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-15 09:44:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-15 09:44:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 09:44:38,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:44:38,056 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:44:38,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 09:44:38,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 09:44:38,272 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:44:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:44:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-15 09:44:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:44:38,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038716399] [2022-04-15 09:44:40,801 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:44:40,802 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:44:40,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:44:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-15 09:44:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:44:40,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888046000] [2022-04-15 09:44:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:44:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:44:40,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:44:40,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457065047] [2022-04-15 09:44:40,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:44:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:44:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:44:40,823 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-15 09:44:40,825 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-15 09:44:40,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:44:40,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:44:40,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 09:44:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:44:40,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:44:42,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-15 09:44:42,780 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-15 09:44:42,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-15 09:44:42,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-15 09:44:42,780 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-15 09:44:42,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-15 09:44:42,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 50);havoc #t~post5; {8115#true} is VALID [2022-04-15 09:44:42,780 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-15 09:44:42,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,781 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-15 09:44:42,781 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-15 09:44:42,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:42,782 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-15 09:44:42,782 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-15 09:44:42,783 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-15 09:44:42,783 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-15 09:44:42,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,784 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-15 09:44:42,784 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-15 09:44:42,785 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-15 09:44:42,785 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 < 50);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-15 09:44:42,785 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-15 09:44:42,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:42,786 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-15 09:44:42,786 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-15 09:44:42,786 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-15 09:44:42,786 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-15 09:44:42,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,787 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-15 09:44:42,787 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-15 09:44:42,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,788 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-15 09:44:42,788 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-15 09:44:42,788 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-15 09:44:42,789 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 < 50);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-15 09:44:42,789 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-15 09:44:42,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,790 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-15 09:44:42,790 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-15 09:44:42,790 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-15 09:44:42,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-15 09:44:42,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-15 09:44:42,790 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-15 09:44:42,791 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-15 09:44:42,792 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-15 09:44:42,792 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-15 09:44:42,793 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 < 50);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-15 09:44:42,793 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-15 09:44:42,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:42,793 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-15 09:44:42,793 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-15 09:44:42,795 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-15 09:44:42,796 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-15 09:44:42,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:44:42,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-15 09:44:42,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-15 09:44:42,797 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-15 09:44:42,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:45:03,738 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:45:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:45:20,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888046000] [2022-04-15 09:45:20,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:45:20,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457065047] [2022-04-15 09:45:20,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457065047] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 09:45:20,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:45:20,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 09:45:20,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:45:20,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038716399] [2022-04-15 09:45:20,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038716399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:45:20,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:45:20,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:45:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414958753] [2022-04-15 09:45:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:45:20,570 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-15 09:45:20,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:45:20,571 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-15 09:45:20,606 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-15 09:45:20,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:45:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:45:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:45:20,607 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-15 09:45:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:21,547 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-15 09:45:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 09:45:21,547 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-15 09:45:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:45:21,547 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-15 09:45:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-15 09:45:21,550 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-15 09:45:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-15 09:45:21,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-15 09:45:21,651 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-15 09:45:21,681 INFO L225 Difference]: With dead ends: 188 [2022-04-15 09:45:21,681 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 09:45:21,681 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:45:21,682 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:45:21,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-04-15 09:45:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 09:45:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-15 09:45:21,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:45:21,806 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-15 09:45:21,806 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-15 09:45:21,806 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-15 09:45:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:21,809 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-15 09:45:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-15 09:45:21,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:21,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:21,810 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-15 09:45:21,810 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-15 09:45:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:21,813 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-15 09:45:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-15 09:45:21,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:21,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:21,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:45:21,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:45:21,814 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-15 09:45:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-15 09:45:21,816 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-15 09:45:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:45:21,817 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-15 09:45:21,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-15 09:45:21,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-15 09:45:21,991 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-15 09:45:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-15 09:45:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 09:45:21,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:45:21,992 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:45:22,009 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-15 09:45:22,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 09:45:22,193 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:45:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:45:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-15 09:45:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:22,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [957884303] [2022-04-15 09:45:26,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:45:26,107 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:45:26,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:45:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-15 09:45:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:45:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003813856] [2022-04-15 09:45:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:45:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:45:26,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:45:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847259282] [2022-04-15 09:45:26,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:45:26,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:45:26,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:45:26,132 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-15 09:45:26,132 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-15 09:45:26,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:45:26,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:45:26,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 09:45:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:45:26,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:45:26,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-15 09:45:26,724 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-15 09:45:26,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-15 09:45:26,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-15 09:45:26,724 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-15 09:45:26,725 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-15 09:45:26,725 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 < 50);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-15 09:45:26,725 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-15 09:45:26,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,726 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-15 09:45:26,726 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-15 09:45:26,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:26,727 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-15 09:45:26,727 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-15 09:45:26,727 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-15 09:45:26,728 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-15 09:45:26,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,728 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-15 09:45:26,729 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-15 09:45:26,729 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-15 09:45:26,729 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 < 50);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-15 09:45:26,730 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-15 09:45:26,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,730 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-15 09:45:26,730 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-15 09:45:26,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,731 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-15 09:45:26,731 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-15 09:45:26,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,732 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-15 09:45:26,732 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-15 09:45:26,733 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-15 09:45:26,733 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 < 50);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-15 09:45:26,733 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-15 09:45:26,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,734 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-15 09:45:26,734 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-15 09:45:26,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:26,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:26,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:26,735 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-15 09:45:26,735 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-15 09:45:26,736 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-15 09:45:26,736 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-15 09:45:26,737 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 < 50);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-15 09:45:26,737 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-15 09:45:26,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:26,737 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-15 09:45:26,737 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-15 09:45:26,738 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-15 09:45:26,738 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-15 09:45:26,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:26,739 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-15 09:45:26,739 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-15 09:45:26,740 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-15 09:45:26,740 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-15 09:45:26,741 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-15 09:45:26,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:26,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-15 09:45:26,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-15 09:45:26,742 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-15 09:45:26,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:45:38,730 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-15 09:45:38,731 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-15 09:45:38,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:38,732 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-15 09:45:38,732 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-15 09:45:38,733 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-15 09:45:38,734 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-15 09:45:38,734 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-15 09:45:38,734 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-15 09:45:38,734 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-15 09:45:38,738 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-15 09:45:38,738 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-15 09:45:38,739 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-15 09:45:38,739 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-15 09:45:38,739 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-15 09:45:38,739 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 50);havoc #t~post6; {9367#true} is VALID [2022-04-15 09:45:38,739 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-15 09:45:38,739 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-15 09:45:38,739 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-15 09:45:38,740 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,740 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-15 09:45:38,740 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,740 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-15 09:45:38,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 50);havoc #t~post6; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-15 09:45:38,740 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,741 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-15 09:45:38,741 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,741 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-15 09:45:38,741 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-15 09:45:38,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,742 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-15 09:45:38,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 50);havoc #t~post5; {9367#true} is VALID [2022-04-15 09:45:38,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-15 09:45:38,743 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-15 09:45:38,743 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,743 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-15 09:45:38,743 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,744 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-15 09:45:38,744 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-15 09:45:38,744 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-15 09:45:38,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 50);havoc #t~post5; {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-15 09:45:38,744 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-15 09:45:38,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-15 09:45:38,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-15 09:45:38,744 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-15 09:45:38,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-15 09:45:38,745 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-15 09:45:38,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:45:38,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003813856] [2022-04-15 09:45:38,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:45:38,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847259282] [2022-04-15 09:45:38,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847259282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:45:38,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:45:38,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-15 09:45:38,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:45:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [957884303] [2022-04-15 09:45:38,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [957884303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:45:38,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:45:38,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 09:45:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827544911] [2022-04-15 09:45:38,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:45:38,746 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-15 09:45:38,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:45:38,747 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-15 09:45:38,790 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-15 09:45:38,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 09:45:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 09:45:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:45:38,796 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-15 09:45:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:39,674 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-15 09:45:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:45:39,674 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-15 09:45:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:45:39,675 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-15 09:45:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 09:45:39,676 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-15 09:45:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 09:45:39,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-15 09:45:39,749 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-15 09:45:39,751 INFO L225 Difference]: With dead ends: 186 [2022-04-15 09:45:39,751 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 09:45:39,751 INFO L912 BasicCegarLoop]: 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-15 09:45:39,752 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:45:39,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:45:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 09:45:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-15 09:45:39,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:45:39,845 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-15 09:45:39,846 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-15 09:45:39,846 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-15 09:45:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:39,848 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-15 09:45:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-15 09:45:39,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:39,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:39,848 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-15 09:45:39,849 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-15 09:45:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:39,851 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-15 09:45:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-15 09:45:39,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:39,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:39,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:45:39,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:45:39,851 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-15 09:45:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-15 09:45:39,853 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-15 09:45:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:45:39,853 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-15 09:45:39,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:45:39,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-15 09:45:39,994 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-15 09:45:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-15 09:45:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 09:45:39,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:45:39,995 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:45:40,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 09:45:40,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 09:45:40,196 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:45:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:45:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-15 09:45:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779346127] [2022-04-15 09:45:44,285 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:45:44,286 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:45:44,286 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:45:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-15 09:45:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:45:44,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571168377] [2022-04-15 09:45:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:45:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:45:44,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:45:44,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805179890] [2022-04-15 09:45:44,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:45:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:45:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:45:44,294 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-15 09:45:44,295 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-15 09:45:44,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 09:45:44,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:45:44,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:45:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:45:44,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:45:44,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-15 09:45:44,663 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-15 09:45:44,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:44,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:44,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:44,664 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-15 09:45:44,665 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-15 09:45:44,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,666 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-15 09:45:44,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,667 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,667 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-15 09:45:44,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,669 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-15 09:45:44,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,671 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:44,671 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-15 09:45:44,672 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-15 09:45:44,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {10791#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,696 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-15 09:45:44,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,697 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,698 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-15 09:45:44,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,699 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,699 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-15 09:45:44,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,701 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:44,701 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-15 09:45:44,702 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-15 09:45:44,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {10846#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,702 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-15 09:45:44,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,703 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,703 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,704 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-15 09:45:44,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,705 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,705 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-15 09:45:44,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,707 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:44,707 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-15 09:45:44,707 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-15 09:45:44,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 50);havoc #t~post5; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 50);havoc #t~post6; {10713#false} is VALID [2022-04-15 09:45:44,708 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-15 09:45:44,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-15 09:45:44,708 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-15 09:45:44,708 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-15 09:45:44,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-15 09:45:44,709 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-15 09:45:44,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:45:45,006 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-15 09:45:45,007 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-15 09:45:45,007 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,007 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-15 09:45:45,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 50);havoc #t~post6; {10713#false} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-15 09:45:45,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {10713#false} is VALID [2022-04-15 09:45:45,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {10975#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10971#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:45:45,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {10975#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,008 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #82#return; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L272 TraceCheckUtils]: 54: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #80#return; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,009 INFO L272 TraceCheckUtils]: 49: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,010 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #78#return; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,010 INFO L272 TraceCheckUtils]: 44: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {11030#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(< ~counter~0 50)} is VALID [2022-04-15 09:45:45,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,013 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #82#return; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,013 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #80#return; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L272 TraceCheckUtils]: 31: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #78#return; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,015 INFO L272 TraceCheckUtils]: 26: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {11030#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {11085#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(< ~counter~0 49)} is VALID [2022-04-15 09:45:45,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {11085#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,016 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #82#return; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,016 INFO L272 TraceCheckUtils]: 18: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #80#return; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L272 TraceCheckUtils]: 13: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #78#return; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-15 09:45:45,017 INFO L272 TraceCheckUtils]: 8: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-15 09:45:45,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(< ~counter~0 48)} is VALID [2022-04-15 09:45:45,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(< ~counter~0 47)} 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 47)} is VALID [2022-04-15 09:45:45,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 47)} call #t~ret7 := main(); {11140#(< ~counter~0 47)} is VALID [2022-04-15 09:45:45,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 47)} {10712#true} #92#return; {11140#(< ~counter~0 47)} is VALID [2022-04-15 09:45:45,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 47)} assume true; {11140#(< ~counter~0 47)} is VALID [2022-04-15 09:45:45,019 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 47)} is VALID [2022-04-15 09:45:45,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-15 09:45:45,020 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-15 09:45:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:45:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571168377] [2022-04-15 09:45:45,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:45:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805179890] [2022-04-15 09:45:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805179890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:45:45,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:45:45,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:45:45,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:45:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779346127] [2022-04-15 09:45:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779346127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:45:45,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:45:45,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:45:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228498076] [2022-04-15 09:45:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:45:45,021 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-15 09:45:45,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:45:45,022 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-15 09:45:45,047 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-15 09:45:45,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:45:45,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:45,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:45:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:45:45,048 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-15 09:45:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:45,321 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-15 09:45:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:45:45,322 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-15 09:45:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:45:45,322 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-15 09:45:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-15 09:45:45,323 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-15 09:45:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-15 09:45:45,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-15 09:45:45,394 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-15 09:45:45,396 INFO L225 Difference]: With dead ends: 170 [2022-04-15 09:45:45,396 INFO L226 Difference]: Without dead ends: 131 [2022-04-15 09:45:45,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:45:45,397 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:45:45,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:45:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-15 09:45:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-15 09:45:45,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:45:45,506 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-15 09:45:45,506 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-15 09:45:45,506 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-15 09:45:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:45,509 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-15 09:45:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-15 09:45:45,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:45,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:45,510 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-15 09:45:45,510 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-15 09:45:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:45,512 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-15 09:45:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-15 09:45:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:45,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:45,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:45:45,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:45:45,513 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-15 09:45:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-15 09:45:45,515 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-15 09:45:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:45:45,515 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-15 09:45:45,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:45:45,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-15 09:45:45,706 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-15 09:45:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-15 09:45:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 09:45:45,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:45:45,707 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:45:45,727 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-15 09:45:45,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 09:45:45,915 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:45:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:45:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-15 09:45:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:45,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412191214] [2022-04-15 09:45:50,004 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:45:50,004 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:45:50,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:45:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-15 09:45:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:45:50,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990739876] [2022-04-15 09:45:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:45:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:45:50,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:45:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336010640] [2022-04-15 09:45:50,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:45:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:45:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:45:50,017 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-15 09:45:50,022 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-15 09:45:50,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:45:50,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:45:50,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:45:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:45:50,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:45:50,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-15 09:45:50,393 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-15 09:45:50,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:50,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:50,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-15 09:45:50,394 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-15 09:45:50,394 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-15 09:45:50,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {12055#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,395 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-15 09:45:50,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,396 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,396 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-15 09:45:50,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,397 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,397 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-15 09:45:50,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,398 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-15 09:45:50,398 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-15 09:45:50,398 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-15 09:45:50,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,399 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-15 09:45:50,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,400 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,400 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-15 09:45:50,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,401 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,401 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-15 09:45:50,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,402 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-15 09:45:50,402 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-15 09:45:50,402 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-15 09:45:50,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {12165#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,403 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-15 09:45:50,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,404 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,404 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-15 09:45:50,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,405 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,405 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-15 09:45:50,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,406 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-15 09:45:50,406 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-15 09:45:50,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {12220#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,407 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-15 09:45:50,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,408 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,408 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-15 09:45:50,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,409 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-15 09:45:50,409 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-15 09:45:50,409 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-15 09:45:50,409 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-15 09:45:50,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {12032#false} is VALID [2022-04-15 09:45:50,430 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-15 09:45:50,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-15 09:45:50,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-15 09:45:50,430 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-15 09:45:50,430 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-15 09:45:50,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:45:50,637 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-15 09:45:50,637 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-15 09:45:50,637 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-15 09:45:50,637 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-15 09:45:50,638 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {12032#false} is VALID [2022-04-15 09:45:50,638 INFO L290 TraceCheckUtils]: 74: Hoare triple {12295#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12291#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:45:50,638 INFO L290 TraceCheckUtils]: 73: Hoare triple {12295#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12295#(< ~counter~0 50)} is VALID [2022-04-15 09:45:50,638 INFO L290 TraceCheckUtils]: 72: Hoare triple {12295#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 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 50)} is VALID [2022-04-15 09:45:50,639 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 50)} #86#return; {12295#(< ~counter~0 50)} is VALID [2022-04-15 09:45:50,639 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,639 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,639 INFO L272 TraceCheckUtils]: 67: Hoare triple {12295#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,639 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 50)} #84#return; {12295#(< ~counter~0 50)} is VALID [2022-04-15 09:45:50,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,640 INFO L272 TraceCheckUtils]: 62: Hoare triple {12295#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {12295#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {12295#(< ~counter~0 50)} is VALID [2022-04-15 09:45:50,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {12338#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12295#(< ~counter~0 50)} is VALID [2022-04-15 09:45:50,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 49)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,641 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #82#return; {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,641 INFO L272 TraceCheckUtils]: 54: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,642 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #80#return; {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,642 INFO L272 TraceCheckUtils]: 49: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,642 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #78#return; {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,643 INFO L272 TraceCheckUtils]: 44: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {12338#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12338#(< ~counter~0 49)} is VALID [2022-04-15 09:45:50,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,644 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #82#return; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,644 INFO L272 TraceCheckUtils]: 36: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #80#return; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L272 TraceCheckUtils]: 31: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #78#return; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,646 INFO L272 TraceCheckUtils]: 26: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {12448#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12393#(< ~counter~0 48)} is VALID [2022-04-15 09:45:50,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {12448#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,647 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #82#return; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,647 INFO L272 TraceCheckUtils]: 18: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,647 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #80#return; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L272 TraceCheckUtils]: 13: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #78#return; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-15 09:45:50,648 INFO L272 TraceCheckUtils]: 8: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-15 09:45:50,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {12448#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {12503#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12448#(< ~counter~0 47)} is VALID [2022-04-15 09:45:50,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {12503#(< ~counter~0 46)} 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 46)} is VALID [2022-04-15 09:45:50,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 46)} call #t~ret7 := main(); {12503#(< ~counter~0 46)} is VALID [2022-04-15 09:45:50,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 46)} {12031#true} #92#return; {12503#(< ~counter~0 46)} is VALID [2022-04-15 09:45:50,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 46)} assume true; {12503#(< ~counter~0 46)} is VALID [2022-04-15 09:45:50,651 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 46)} is VALID [2022-04-15 09:45:50,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-15 09:45:50,651 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-15 09:45:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:45:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990739876] [2022-04-15 09:45:50,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:45:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336010640] [2022-04-15 09:45:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336010640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:45:50,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:45:50,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:45:50,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:45:50,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412191214] [2022-04-15 09:45:50,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412191214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:45:50,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:45:50,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:45:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504351554] [2022-04-15 09:45:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:45:50,652 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-15 09:45:50,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:45:50,655 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-15 09:45:50,694 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-15 09:45:50,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:45:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:45:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:45:50,695 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-15 09:45:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:51,044 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-15 09:45:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:45:51,044 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-15 09:45:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:45:51,046 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-15 09:45:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-15 09:45:51,048 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-15 09:45:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-15 09:45:51,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-15 09:45:51,154 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-15 09:45:51,158 INFO L225 Difference]: With dead ends: 181 [2022-04-15 09:45:51,158 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 09:45:51,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:45:51,158 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:45:51,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:45:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 09:45:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-15 09:45:51,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:45:51,307 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-15 09:45:51,307 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-15 09:45:51,307 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-15 09:45:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:51,313 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-15 09:45:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-15 09:45:51,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:51,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:51,314 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-15 09:45:51,314 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-15 09:45:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:45:51,317 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-15 09:45:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-15 09:45:51,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:45:51,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:45:51,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:45:51,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:45:51,318 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-15 09:45:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-15 09:45:51,321 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-15 09:45:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:45:51,321 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-15 09:45:51,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-15 09:45:51,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-15 09:45:51,532 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-15 09:45:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-15 09:45:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 09:45:51,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:45:51,533 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:45:51,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 09:45:51,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 09:45:51,734 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:45:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:45:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-15 09:45:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:45:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653427666] [2022-04-15 09:45:55,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:45:55,824 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:45:55,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:45:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-15 09:45:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:45:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108193548] [2022-04-15 09:45:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:45:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:45:55,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:45:55,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890297161] [2022-04-15 09:45:55,836 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:45:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:45:55,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:45:55,843 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-15 09:45:55,844 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-15 09:45:55,888 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 09:45:55,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:45:55,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 09:45:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:45:55,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:45:56,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-15 09:45:56,647 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-15 09:45:56,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-15 09:45:56,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-15 09:45:56,648 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-15 09:45:56,648 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-15 09:45:56,648 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 < 50);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 09:45:56,648 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-15 09:45:56,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,649 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-15 09:45:56,649 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-15 09:45:56,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,650 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-15 09:45:56,650 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-15 09:45:56,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,651 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-15 09:45:56,651 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-15 09:45:56,652 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-15 09:45:56,652 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 < 50);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 09:45:56,652 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-15 09:45:56,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,653 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-15 09:45:56,653 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-15 09:45:56,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,654 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-15 09:45:56,654 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-15 09:45:56,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,655 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-15 09:45:56,655 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-15 09:45:56,656 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-15 09:45:56,656 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 < 50);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-15 09:45:56,656 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-15 09:45:56,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,657 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-15 09:45:56,657 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-15 09:45:56,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,658 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-15 09:45:56,658 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-15 09:45:56,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:56,659 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-15 09:45:56,659 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-15 09:45:56,660 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-15 09:45:56,660 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-15 09:45:56,661 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-15 09:45:56,661 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 < 50);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-15 09:45:56,661 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-15 09:45:56,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,662 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-15 09:45:56,662 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-15 09:45:56,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:45:56,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:45:56,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:45:56,663 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-15 09:45:56,664 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-15 09:45:56,665 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-15 09:45:56,665 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-15 09:45:56,666 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 < 50);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-15 09:45:56,666 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-15 09:45:56,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:45:56,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-15 09:45:56,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-15 09:45:56,667 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-15 09:45:56,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:47:12,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-15 09:47:12,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-15 09:47:12,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:47:12,389 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-15 09:47:12,389 INFO L290 TraceCheckUtils]: 75: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:47:12,390 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-15 09:47:12,407 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-15 09:47:12,424 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-15 09:47:12,425 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-15 09:47:12,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,425 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-15 09:47:12,426 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-15 09:47:12,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,426 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-15 09:47:12,427 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 < 50);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-15 09:47:12,428 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-15 09:47:12,428 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-15 09:47:12,429 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-15 09:47:12,430 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-15 09:47:12,430 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-15 09:47:12,430 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-15 09:47:12,430 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-15 09:47:12,431 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-15 09:47:12,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,431 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-15 09:47:12,431 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-15 09:47:12,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,432 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-15 09:47:12,433 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 < 50);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-15 09:47:12,434 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-15 09:47:12,439 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-15 09:47:12,439 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-15 09:47:12,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,439 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-15 09:47:12,440 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-15 09:47:12,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,440 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-15 09:47:12,452 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-15 09:47:12,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,452 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-15 09:47:12,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 50);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:47:12,453 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-15 09:47:12,453 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-15 09:47:12,453 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-15 09:47:12,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,454 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-15 09:47:12,454 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-15 09:47:12,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,454 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-15 09:47:12,455 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-15 09:47:12,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-15 09:47:12,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-15 09:47:12,455 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-15 09:47:12,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 50);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:47:12,456 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-15 09:47:12,456 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-15 09:47:12,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-15 09:47:12,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-15 09:47:12,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 09:47:12,456 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-15 09:47:12,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-15 09:47:12,457 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-15 09:47:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:47:12,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108193548] [2022-04-15 09:47:12,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:47:12,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890297161] [2022-04-15 09:47:12,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890297161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:47:12,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:47:12,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-15 09:47:12,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:47:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653427666] [2022-04-15 09:47:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653427666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:47:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:47:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:47:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142541029] [2022-04-15 09:47:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:47:12,459 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-15 09:47:12,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:47:12,460 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-15 09:47:12,501 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-15 09:47:12,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:47:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:47:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:47:12,502 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-15 09:47:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:13,286 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-15 09:47:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:47:13,286 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-15 09:47:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:47:13,287 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-15 09:47:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 09:47:13,288 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-15 09:47:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 09:47:13,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-15 09:47:13,402 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-15 09:47:13,406 INFO L225 Difference]: With dead ends: 193 [2022-04-15 09:47:13,406 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 09:47:13,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:47:13,406 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:47:13,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:47:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 09:47:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-15 09:47:13,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:47:13,542 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-15 09:47:13,542 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-15 09:47:13,542 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-15 09:47:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:13,545 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-15 09:47:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-15 09:47:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:13,545 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-15 09:47:13,546 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-15 09:47:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:13,549 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-15 09:47:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-15 09:47:13,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:13,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:13,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:47:13,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:47:13,550 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-15 09:47:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-15 09:47:13,552 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-15 09:47:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:47:13,552 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-15 09:47:13,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:47:13,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-15 09:47:13,768 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-15 09:47:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-15 09:47:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 09:47:13,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:47:13,769 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:47:13,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 09:47:13,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:13,970 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:47:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:47:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-15 09:47:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:13,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391403022] [2022-04-15 09:47:16,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:47:16,594 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:47:16,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:47:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-15 09:47:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:47:16,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702299155] [2022-04-15 09:47:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:47:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:47:16,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:47:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601253308] [2022-04-15 09:47:16,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:47:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:47:16,652 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-15 09:47:16,714 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-15 09:47:16,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:47:16,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:47:16,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 09:47:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:47:16,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:47:18,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-15 09:47:18,508 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-15 09:47:18,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-15 09:47:18,509 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-15 09:47:18,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 50);havoc #t~post5; {15115#true} is VALID [2022-04-15 09:47:18,509 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-15 09:47:18,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-15 09:47:18,509 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-15 09:47:18,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,510 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-15 09:47:18,510 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-15 09:47:18,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-15 09:47:18,511 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-15 09:47:18,511 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-15 09:47:18,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post5 < 50);havoc #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 09:47:18,511 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-15 09:47:18,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,512 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-15 09:47:18,512 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-15 09:47:18,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,512 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-15 09:47:18,512 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-15 09:47:18,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,513 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-15 09:47:18,514 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-15 09:47:18,514 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-15 09:47:18,514 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 < 50);havoc #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 09:47:18,514 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-15 09:47:18,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,515 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-15 09:47:18,515 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-15 09:47:18,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,515 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-15 09:47:18,515 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-15 09:47:18,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,516 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-15 09:47:18,516 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-15 09:47:18,516 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-15 09:47:18,517 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 < 50);havoc #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 09:47:18,517 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-15 09:47:18,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,517 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-15 09:47:18,517 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-15 09:47:18,517 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,517 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,517 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,518 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-15 09:47:18,519 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-15 09:47:18,519 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-15 09:47:18,519 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-15 09:47:18,520 INFO L290 TraceCheckUtils]: 75: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post6 < 50);havoc #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 09:47:18,520 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-15 09:47:18,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,520 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,520 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-15 09:47:18,520 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-15 09:47:18,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,521 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-15 09:47:18,521 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-15 09:47:18,521 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-15 09:47:18,521 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-15 09:47:18,521 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-15 09:47:18,521 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-15 09:47:18,521 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-15 09:47:18,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:47:18,650 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-15 09:47:18,650 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-15 09:47:18,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-15 09:47:18,650 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-15 09:47:18,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-15 09:47:18,651 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-15 09:47:18,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,651 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,651 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-15 09:47:18,651 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-15 09:47:18,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,651 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,651 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-15 09:47:18,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-15 09:47:18,652 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-15 09:47:18,652 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-15 09:47:18,653 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-15 09:47:18,653 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-15 09:47:18,653 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,653 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-15 09:47:18,654 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-15 09:47:18,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,654 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-15 09:47:18,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 09:47:18,654 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-15 09:47:18,655 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-15 09:47:18,655 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-15 09:47:18,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,655 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-15 09:47:18,655 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-15 09:47:18,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,656 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-15 09:47:18,656 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-15 09:47:18,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,656 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-15 09:47:18,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 09:47:18,657 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-15 09:47:18,657 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-15 09:47:18,657 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-15 09:47:18,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,658 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-15 09:47:18,658 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-15 09:47:18,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,658 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-15 09:47:18,659 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-15 09:47:18,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,659 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-15 09:47:18,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-15 09:47:18,659 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-15 09:47:18,660 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-15 09:47:18,660 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,660 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-15 09:47:18,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,660 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-15 09:47:18,660 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-15 09:47:18,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-15 09:47:18,661 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-15 09:47:18,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 50);havoc #t~post5; {15115#true} is VALID [2022-04-15 09:47:18,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-15 09:47:18,661 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-15 09:47:18,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-15 09:47:18,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-15 09:47:18,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-15 09:47:18,661 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-15 09:47:18,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-15 09:47:18,661 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-15 09:47:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:47:18,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702299155] [2022-04-15 09:47:18,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:47:18,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601253308] [2022-04-15 09:47:18,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601253308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:47:18,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:47:18,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-15 09:47:18,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:47:18,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391403022] [2022-04-15 09:47:18,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391403022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:47:18,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:47:18,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:47:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103380772] [2022-04-15 09:47:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:47:18,663 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-15 09:47:18,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:47:18,663 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-15 09:47:18,693 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-15 09:47:18,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:47:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:47:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:47:18,694 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-15 09:47:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:18,861 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-15 09:47:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:47:18,861 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-15 09:47:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:47:18,862 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-15 09:47:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 09:47:18,862 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-15 09:47:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-15 09:47:18,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-15 09:47:18,910 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-15 09:47:18,912 INFO L225 Difference]: With dead ends: 197 [2022-04-15 09:47:18,912 INFO L226 Difference]: Without dead ends: 184 [2022-04-15 09:47:18,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:47:18,913 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:47:18,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:47:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-15 09:47:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-15 09:47:19,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:47:19,062 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-15 09:47:19,062 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-15 09:47:19,063 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-15 09:47:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:19,065 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-15 09:47:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-15 09:47:19,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:19,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:19,066 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-15 09:47:19,066 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-15 09:47:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:19,069 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-15 09:47:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-15 09:47:19,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:19,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:19,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:47:19,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:47:19,070 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-15 09:47:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-15 09:47:19,074 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-15 09:47:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:47:19,074 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-15 09:47:19,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 09:47:19,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-15 09:47:19,329 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-15 09:47:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-15 09:47:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 09:47:19,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:47:19,330 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:47:19,377 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-15 09:47:19,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:19,531 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:47:19,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:47:19,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-15 09:47:19,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:19,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655845160] [2022-04-15 09:47:23,622 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:47:23,622 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:47:23,622 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:47:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-15 09:47:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:47:23,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394495492] [2022-04-15 09:47:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:47:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:47:23,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:47:23,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313186820] [2022-04-15 09:47:23,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:47:23,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:47:23,632 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-15 09:47:23,633 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-15 09:47:23,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:47:23,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:47:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:47:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:47:23,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:47:24,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-15 09:47:24,087 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-15 09:47:24,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:24,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:24,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:24,089 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-15 09:47:24,089 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-15 09:47:24,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {16812#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,090 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-15 09:47:24,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,092 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,092 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-15 09:47:24,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,093 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,094 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-15 09:47:24,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,096 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:24,096 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-15 09:47:24,097 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-15 09:47:24,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {16867#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,098 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-15 09:47:24,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,099 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,100 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-15 09:47:24,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,101 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,102 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-15 09:47:24,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,103 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:24,104 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-15 09:47:24,104 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-15 09:47:24,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {16922#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,105 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-15 09:47:24,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,106 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,107 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-15 09:47:24,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,108 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,109 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-15 09:47:24,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,110 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:24,110 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-15 09:47:24,111 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-15 09:47:24,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {16977#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,112 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-15 09:47:24,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,113 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,113 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-15 09:47:24,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,115 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,115 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-15 09:47:24,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,117 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:24,117 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-15 09:47:24,117 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-15 09:47:24,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 50);havoc #t~post6; {16789#false} is VALID [2022-04-15 09:47:24,118 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-15 09:47:24,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-15 09:47:24,118 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-15 09:47:24,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-15 09:47:24,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-15 09:47:24,119 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-15 09:47:24,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:47:24,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-15 09:47:24,540 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-15 09:47:24,540 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,540 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-15 09:47:24,540 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 50);havoc #t~post6; {16789#false} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-15 09:47:24,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {16789#false} is VALID [2022-04-15 09:47:24,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {17106#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17102#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:47:24,541 INFO L290 TraceCheckUtils]: 77: Hoare triple {17106#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,542 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #82#return; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,542 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,542 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,542 INFO L272 TraceCheckUtils]: 72: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,543 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #80#return; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,543 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,543 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,543 INFO L272 TraceCheckUtils]: 67: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,543 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #78#return; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,544 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,544 INFO L272 TraceCheckUtils]: 62: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {17106#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {17161#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17106#(< ~counter~0 50)} is VALID [2022-04-15 09:47:24,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {17161#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,546 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #82#return; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,546 INFO L272 TraceCheckUtils]: 54: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #80#return; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L272 TraceCheckUtils]: 49: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #78#return; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,548 INFO L272 TraceCheckUtils]: 44: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {17161#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {17216#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17161#(< ~counter~0 49)} is VALID [2022-04-15 09:47:24,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {17216#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,550 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #82#return; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,550 INFO L272 TraceCheckUtils]: 36: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,550 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #80#return; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L272 TraceCheckUtils]: 31: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #78#return; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,551 INFO L272 TraceCheckUtils]: 26: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {17216#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {17271#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17216#(< ~counter~0 48)} is VALID [2022-04-15 09:47:24,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {17271#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,553 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #82#return; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #80#return; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,555 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #78#return; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-15 09:47:24,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-15 09:47:24,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-15 09:47:24,555 INFO L272 TraceCheckUtils]: 8: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-15 09:47:24,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {17271#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {17326#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17271#(< ~counter~0 47)} is VALID [2022-04-15 09:47:24,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {17326#(< ~counter~0 46)} 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 46)} is VALID [2022-04-15 09:47:24,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 46)} call #t~ret7 := main(); {17326#(< ~counter~0 46)} is VALID [2022-04-15 09:47:24,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 46)} {16788#true} #92#return; {17326#(< ~counter~0 46)} is VALID [2022-04-15 09:47:24,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 46)} assume true; {17326#(< ~counter~0 46)} is VALID [2022-04-15 09:47:24,558 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 46)} is VALID [2022-04-15 09:47:24,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-15 09:47:24,558 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-15 09:47:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:47:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394495492] [2022-04-15 09:47:24,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:47:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313186820] [2022-04-15 09:47:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313186820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:47:24,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:47:24,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:47:24,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:47:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655845160] [2022-04-15 09:47:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655845160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:47:24,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:47:24,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:47:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646089490] [2022-04-15 09:47:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:47:24,560 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-15 09:47:24,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:47:24,560 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-15 09:47:24,612 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-15 09:47:24,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:47:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:24,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:47:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:47:24,612 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-15 09:47:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:24,997 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-15 09:47:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:47:24,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-15 09:47:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:47:24,997 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-15 09:47:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-15 09:47:24,998 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-15 09:47:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-15 09:47:25,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-15 09:47:25,084 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-15 09:47:25,087 INFO L225 Difference]: With dead ends: 242 [2022-04-15 09:47:25,087 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 09:47:25,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:47:25,088 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:47:25,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:47:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 09:47:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-15 09:47:25,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:47:25,232 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-15 09:47:25,232 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-15 09:47:25,233 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-15 09:47:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:25,235 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-15 09:47:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-15 09:47:25,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:25,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:25,236 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-15 09:47:25,236 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-15 09:47:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:25,239 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-15 09:47:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-15 09:47:25,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:25,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:25,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:47:25,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:47:25,240 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-15 09:47:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-15 09:47:25,243 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-15 09:47:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:47:25,243 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-15 09:47:25,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:47:25,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-15 09:47:25,505 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-15 09:47:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-15 09:47:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 09:47:25,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:47:25,506 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:47:25,523 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-15 09:47:25,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:25,706 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:47:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:47:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-15 09:47:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436236460] [2022-04-15 09:47:29,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:47:29,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:47:29,721 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:47:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-15 09:47:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:47:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690419304] [2022-04-15 09:47:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:47:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:47:29,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:47:29,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455576600] [2022-04-15 09:47:29,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:47:29,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:29,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:47:29,732 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-15 09:47:29,733 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-15 09:47:29,807 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:47:29,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:47:29,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:47:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:47:29,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:47:30,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-15 09:47:30,230 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-15 09:47:30,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:30,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:30,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-15 09:47:30,231 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-15 09:47:30,232 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-15 09:47:30,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {18591#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,232 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-15 09:47:30,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,233 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,233 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-15 09:47:30,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,234 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,235 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-15 09:47:30,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,236 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-15 09:47:30,236 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-15 09:47:30,236 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-15 09:47:30,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {18646#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,237 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-15 09:47:30,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,238 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,238 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-15 09:47:30,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,239 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,239 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-15 09:47:30,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,240 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-15 09:47:30,241 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-15 09:47:30,241 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-15 09:47:30,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {18701#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,242 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-15 09:47:30,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,242 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,243 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-15 09:47:30,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,244 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,244 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-15 09:47:30,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,245 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-15 09:47:30,246 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-15 09:47:30,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {18756#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,246 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-15 09:47:30,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,247 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,248 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-15 09:47:30,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,249 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-15 09:47:30,249 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-15 09:47:30,249 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-15 09:47:30,249 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-15 09:47:30,250 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,250 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-15 09:47:30,250 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,250 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,251 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,251 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-15 09:47:30,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,252 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-15 09:47:30,252 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-15 09:47:30,253 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-15 09:47:30,253 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-15 09:47:30,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {18568#false} is VALID [2022-04-15 09:47:30,253 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-15 09:47:30,253 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-15 09:47:30,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-15 09:47:30,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-15 09:47:30,254 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-15 09:47:30,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:47:30,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-15 09:47:30,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-15 09:47:30,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-15 09:47:30,481 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-15 09:47:30,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {18568#false} is VALID [2022-04-15 09:47:30,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {18874#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18870#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:47:30,481 INFO L290 TraceCheckUtils]: 87: Hoare triple {18874#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18874#(< ~counter~0 50)} is VALID [2022-04-15 09:47:30,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {18874#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 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 50)} is VALID [2022-04-15 09:47:30,482 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 50)} #86#return; {18874#(< ~counter~0 50)} is VALID [2022-04-15 09:47:30,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,482 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,482 INFO L272 TraceCheckUtils]: 81: Hoare triple {18874#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,482 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 50)} #84#return; {18874#(< ~counter~0 50)} is VALID [2022-04-15 09:47:30,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,483 INFO L272 TraceCheckUtils]: 76: Hoare triple {18874#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {18874#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {18874#(< ~counter~0 50)} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {18917#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18874#(< ~counter~0 50)} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {18917#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18917#(< ~counter~0 49)} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {18917#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 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 49)} is VALID [2022-04-15 09:47:30,484 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 49)} #86#return; {18917#(< ~counter~0 49)} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,484 INFO L272 TraceCheckUtils]: 67: Hoare triple {18917#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,485 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 49)} #84#return; {18917#(< ~counter~0 49)} is VALID [2022-04-15 09:47:30,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,485 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,485 INFO L272 TraceCheckUtils]: 62: Hoare triple {18917#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {18917#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {18917#(< ~counter~0 49)} is VALID [2022-04-15 09:47:30,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {18960#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18917#(< ~counter~0 49)} is VALID [2022-04-15 09:47:30,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 48)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,486 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #82#return; {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,486 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,486 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,486 INFO L272 TraceCheckUtils]: 54: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #80#return; {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L272 TraceCheckUtils]: 49: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #78#return; {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,488 INFO L272 TraceCheckUtils]: 44: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {18960#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {19015#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18960#(< ~counter~0 48)} is VALID [2022-04-15 09:47:30,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {19015#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,493 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #82#return; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L272 TraceCheckUtils]: 36: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #80#return; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,493 INFO L272 TraceCheckUtils]: 31: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,494 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #78#return; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,494 INFO L272 TraceCheckUtils]: 26: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {19015#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {19070#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19015#(< ~counter~0 47)} is VALID [2022-04-15 09:47:30,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {19070#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,495 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #82#return; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,495 INFO L272 TraceCheckUtils]: 18: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #80#return; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L272 TraceCheckUtils]: 13: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #78#return; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-15 09:47:30,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-15 09:47:30,497 INFO L272 TraceCheckUtils]: 8: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-15 09:47:30,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {19070#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {19125#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19070#(< ~counter~0 46)} is VALID [2022-04-15 09:47:30,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {19125#(< ~counter~0 45)} 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 45)} is VALID [2022-04-15 09:47:30,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 45)} call #t~ret7 := main(); {19125#(< ~counter~0 45)} is VALID [2022-04-15 09:47:30,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 45)} {18567#true} #92#return; {19125#(< ~counter~0 45)} is VALID [2022-04-15 09:47:30,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 45)} assume true; {19125#(< ~counter~0 45)} is VALID [2022-04-15 09:47:30,498 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 45)} is VALID [2022-04-15 09:47:30,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-15 09:47:30,499 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-15 09:47:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:47:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690419304] [2022-04-15 09:47:30,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:47:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455576600] [2022-04-15 09:47:30,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455576600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:47:30,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:47:30,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:47:30,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:47:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436236460] [2022-04-15 09:47:30,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436236460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:47:30,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:47:30,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:47:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209833364] [2022-04-15 09:47:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:47:30,501 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-15 09:47:30,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:47:30,501 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-15 09:47:30,532 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-15 09:47:30,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:47:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:47:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:47:30,533 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-15 09:47:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:30,943 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-15 09:47:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:47:30,944 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-15 09:47:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:47:30,944 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-15 09:47:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-15 09:47:30,946 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-15 09:47:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-15 09:47:30,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-15 09:47:31,042 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-15 09:47:31,046 INFO L225 Difference]: With dead ends: 240 [2022-04-15 09:47:31,046 INFO L226 Difference]: Without dead ends: 227 [2022-04-15 09:47:31,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:47:31,047 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:47:31,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:47:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-15 09:47:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-15 09:47:31,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:47:31,222 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-15 09:47:31,222 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-15 09:47:31,222 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-15 09:47:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:31,226 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-15 09:47:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-15 09:47:31,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:31,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:31,227 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-15 09:47:31,227 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-15 09:47:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:47:31,231 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-15 09:47:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-15 09:47:31,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:47:31,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:47:31,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:47:31,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:47:31,232 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-15 09:47:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-15 09:47:31,236 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-15 09:47:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:47:31,236 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-15 09:47:31,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:47:31,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-15 09:47:31,583 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-15 09:47:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-15 09:47:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 09:47:31,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:47:31,584 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:47:31,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 09:47:31,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:31,785 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:47:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:47:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-15 09:47:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:47:31,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833337390] [2022-04-15 09:47:35,863 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:47:35,863 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:47:35,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:47:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-15 09:47:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:47:35,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816519613] [2022-04-15 09:47:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:47:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:47:35,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:47:35,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426349043] [2022-04-15 09:47:35,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:47:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:47:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:47:35,883 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-15 09:47:35,884 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-15 09:47:35,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:47:35,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:47:35,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 09:47:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:47:35,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:47:36,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-15 09:47:36,566 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-15 09:47:36,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-15 09:47:36,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-15 09:47:36,566 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-15 09:47:36,567 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-15 09:47:36,567 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 < 50);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-15 09:47:36,567 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-15 09:47:36,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,568 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-15 09:47:36,568 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-15 09:47:36,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,568 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-15 09:47:36,568 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-15 09:47:36,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,569 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-15 09:47:36,569 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-15 09:47:36,570 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-15 09:47:36,570 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 < 50);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-15 09:47:36,570 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-15 09:47:36,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,571 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-15 09:47:36,571 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-15 09:47:36,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,571 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-15 09:47:36,571 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-15 09:47:36,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,581 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-15 09:47:36,582 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-15 09:47:36,582 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-15 09:47:36,582 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 < 50);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-15 09:47:36,583 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-15 09:47:36,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,583 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-15 09:47:36,583 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-15 09:47:36,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,584 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-15 09:47:36,584 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-15 09:47:36,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,584 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-15 09:47:36,585 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-15 09:47:36,585 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-15 09:47:36,585 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 < 50);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-15 09:47:36,586 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-15 09:47:36,586 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,586 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,586 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,586 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-15 09:47:36,586 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-15 09:47:36,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,587 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-15 09:47:36,587 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-15 09:47:36,588 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-15 09:47:36,588 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-15 09:47:36,588 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 < 50);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-15 09:47:36,588 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-15 09:47:36,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,589 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-15 09:47:36,589 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-15 09:47:36,589 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:47:36,589 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:47:36,589 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:47:36,590 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-15 09:47:36,591 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-15 09:47:36,591 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-15 09:47:36,592 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-15 09:47:36,592 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 < 50);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-15 09:47:36,593 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-15 09:47:36,593 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:47:36,593 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-15 09:47:36,593 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-15 09:47:36,593 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-15 09:47:36,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:48:13,017 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-15 09:48:13,018 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-15 09:48:13,018 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:48:13,019 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-15 09:48:13,019 INFO L290 TraceCheckUtils]: 89: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:48:13,020 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-15 09:48:13,031 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-15 09:48:13,048 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-15 09:48:13,049 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-15 09:48:13,049 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,049 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,049 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,049 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-15 09:48:13,049 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-15 09:48:13,050 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,050 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,050 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,050 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-15 09:48:13,051 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 < 50);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-15 09:48:13,052 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-15 09:48:13,077 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-15 09:48:13,272 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-15 09:48:13,273 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-15 09:48:13,274 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,274 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-15 09:48:13,277 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-15 09:48:13,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,277 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-15 09:48:13,285 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 < 50);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-15 09:48:13,289 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-15 09:48:13,292 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-15 09:48:13,307 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-15 09:48:13,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,307 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,307 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-15 09:48:13,308 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-15 09:48:13,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,308 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-15 09:48:13,310 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-15 09:48:13,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,310 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-15 09:48:13,315 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 < 50);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-15 09:48:13,319 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-15 09:48:13,527 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-15 09:48:13,528 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-15 09:48:13,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,529 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-15 09:48:13,529 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-15 09:48:13,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,529 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-15 09:48:13,530 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-15 09:48:13,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,530 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-15 09:48:13,531 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 < 50);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-15 09:48:13,532 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-15 09:48:13,555 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-15 09:48:13,555 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-15 09:48:13,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,556 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-15 09:48:13,556 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-15 09:48:13,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,557 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-15 09:48:13,557 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-15 09:48:13,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-15 09:48:13,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-15 09:48:13,557 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-15 09:48:13,559 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 < 50);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-15 09:48:13,559 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-15 09:48:13,559 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-15 09:48:13,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-15 09:48:13,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-15 09:48:13,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-15 09:48:13,560 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-15 09:48:13,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-15 09:48:13,561 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-15 09:48:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:48:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816519613] [2022-04-15 09:48:13,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:48:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426349043] [2022-04-15 09:48:13,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426349043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:48:13,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:48:13,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-15 09:48:13,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:48:13,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833337390] [2022-04-15 09:48:13,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833337390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:48:13,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:48:13,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:48:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338424924] [2022-04-15 09:48:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:48:13,562 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-15 09:48:13,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:48:13,563 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-15 09:48:13,612 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-15 09:48:13,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:48:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:48:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:48:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2022-04-15 09:48:13,613 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-15 09:48:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:48:14,888 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-15 09:48:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:48:14,888 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-15 09:48:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:48:14,889 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-15 09:48:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-15 09:48:14,890 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-15 09:48:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-15 09:48:14,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-15 09:48:15,012 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-15 09:48:15,016 INFO L225 Difference]: With dead ends: 275 [2022-04-15 09:48:15,016 INFO L226 Difference]: Without dead ends: 240 [2022-04-15 09:48:15,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=64, Invalid=206, Unknown=2, NotChecked=0, Total=272 [2022-04-15 09:48:15,017 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 09:48:15,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 09:48:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-15 09:48:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-15 09:48:15,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:48:15,234 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-15 09:48:15,234 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-15 09:48:15,234 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-15 09:48:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:48:15,238 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-15 09:48:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-15 09:48:15,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:48:15,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:48:15,238 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-15 09:48:15,239 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-15 09:48:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:48:15,242 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-15 09:48:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-15 09:48:15,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:48:15,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:48:15,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:48:15,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:48:15,243 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-15 09:48:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-15 09:48:15,246 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-15 09:48:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:48:15,247 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-15 09:48:15,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 09:48:15,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-15 09:48:15,553 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-15 09:48:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-15 09:48:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 09:48:15,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:48:15,554 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:48:15,584 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-15 09:48:15,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:48:15,755 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:48:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:48:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-15 09:48:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:48:15,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085715777] [2022-04-15 09:48:19,437 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:48:19,437 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:48:19,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:48:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-15 09:48:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:48:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711760101] [2022-04-15 09:48:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:48:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:48:19,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:48:19,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947507216] [2022-04-15 09:48:19,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:48:19,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:48:19,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:48:19,447 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-15 09:48:19,480 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-15 09:48:19,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:48:19,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:48:19,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 09:48:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:48:19,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:50:40,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-15 09:50:40,137 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-15 09:50:40,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:40,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-15 09:50:40,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-15 09:50:40,137 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-15 09:50:40,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-15 09:50:40,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 50);havoc #t~post5; {22623#true} is VALID [2022-04-15 09:50:40,137 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-15 09:50:40,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:40,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:40,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:40,138 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-15 09:50:40,138 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-15 09:50:40,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:40,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:40,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:40,138 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-15 09:50:40,138 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-15 09:50:40,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:50:40,139 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-15 09:50:40,139 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-15 09:50:40,139 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-15 09:50:42,141 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-15 09:50:42,142 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-15 09:50:42,143 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 < 50);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-15 09:50:42,143 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-15 09:50:42,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:42,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:42,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:42,144 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-15 09:50:42,144 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-15 09:50:42,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:42,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:42,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:42,144 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-15 09:50:42,144 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-15 09:50:42,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:42,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:42,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:42,145 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-15 09:50:43,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 09:50:43,036 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-15 09:50:43,037 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 < 50);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-15 09:50:43,037 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-15 09:50:43,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:43,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:43,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:43,037 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-15 09:50:43,038 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-15 09:50:43,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:43,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:43,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:43,038 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-15 09:50:43,038 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-15 09:50:43,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:43,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:43,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:43,039 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-15 09:50:43,040 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-15 09:50:43,040 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-15 09:50:43,041 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 < 50);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-15 09:50:43,041 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-15 09:50:43,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:43,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:43,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:43,041 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-15 09:50:43,041 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-15 09:50:43,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:50:43,042 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-15 09:50:43,042 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-15 09:50:43,043 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #86#return; {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 09:50:45,046 WARN L290 TraceCheckUtils]: 72: Hoare triple {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} is UNKNOWN [2022-04-15 09:50:45,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-15 09:50:45,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-15 09:50:45,179 INFO L290 TraceCheckUtils]: 75: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} assume !!(#t~post6 < 50);havoc #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-15 09:50:45,179 INFO L272 TraceCheckUtils]: 76: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:50:45,180 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:45,180 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:45,180 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:45,180 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #84#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-15 09:50:45,180 INFO L272 TraceCheckUtils]: 81: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:50:45,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:50:45,181 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-15 09:50:45,181 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-15 09:50:45,182 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #86#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-15 09:50:45,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-15 09:50:45,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-15 09:50:45,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-15 09:50:45,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume !!(#t~post6 < 50);havoc #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-15 09:50:45,212 INFO L272 TraceCheckUtils]: 90: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:50:45,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:50:45,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:50:45,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:50:45,213 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #84#return; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-15 09:50:45,213 INFO L272 TraceCheckUtils]: 95: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:50:45,214 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:50:45,214 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-15 09:50:45,214 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-15 09:50:45,215 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-15 09:50:45,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:52:47,466 WARN L232 SmtUtils]: Spent 7.94s 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-15 09:54:45,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-15 09:54:45,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-15 09:54:45,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:54:45,376 INFO L272 TraceCheckUtils]: 95: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:54:45,376 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-15 09:54:45,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,377 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,377 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-15 09:54:45,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post6 < 50);havoc #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 09:54:45,377 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-15 09:54:45,378 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-15 09:54:45,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {22970#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 09:54:45,405 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {22970#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} is VALID [2022-04-15 09:54:45,405 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-15 09:54:45,406 INFO L290 TraceCheckUtils]: 83: Hoare triple {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:54:45,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:54:45,406 INFO L272 TraceCheckUtils]: 81: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,407 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,407 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,407 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,407 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,407 INFO L272 TraceCheckUtils]: 76: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,418 INFO L290 TraceCheckUtils]: 74: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {23015#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,822 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {23015#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-15 09:54:45,823 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-15 09:54:45,823 INFO L290 TraceCheckUtils]: 69: Hoare triple {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:54:45,823 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:54:45,823 INFO L272 TraceCheckUtils]: 67: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,824 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,824 INFO L272 TraceCheckUtils]: 62: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,826 INFO L290 TraceCheckUtils]: 61: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-15 09:54:45,829 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #82#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L272 TraceCheckUtils]: 54: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #80#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,830 INFO L272 TraceCheckUtils]: 49: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,831 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #78#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,831 INFO L272 TraceCheckUtils]: 44: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:54:45,875 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #82#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,876 INFO L272 TraceCheckUtils]: 36: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,881 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #80#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L272 TraceCheckUtils]: 31: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #78#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,882 INFO L272 TraceCheckUtils]: 26: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-15 09:54:45,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(#t~post5 < 50);havoc #t~post5; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-15 09:54:45,888 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-15 09:54:45,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,888 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-15 09:54:45,888 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-15 09:54:45,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,889 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-15 09:54:45,889 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-15 09:54:45,889 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-15 09:54:45,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 50);havoc #t~post5; {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-15 09:54:45,889 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-15 09:54:45,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-15 09:54:45,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-15 09:54:45,889 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-15 09:54:45,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-15 09:54:45,890 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-15 09:54:45,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:54:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711760101] [2022-04-15 09:54:45,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:54:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947507216] [2022-04-15 09:54:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947507216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:54:45,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:54:45,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2022-04-15 09:54:45,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:54:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085715777] [2022-04-15 09:54:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085715777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:54:45,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:54:45,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:54:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048491037] [2022-04-15 09:54:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:54:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-15 09:54:45,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:54:45,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 09:54:49,793 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-15 09:54:49,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:54:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:54:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:54:49,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=320, Unknown=5, NotChecked=0, Total=420 [2022-04-15 09:54:49,794 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 09:54:51,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:00,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:02,095 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-15 09:55:05,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:07,799 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-15 09:55:10,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:14,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:16,928 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-15 09:55:18,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:22,645 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-15 09:55:29,728 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-15 09:55:39,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:45,606 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-15 09:55:52,794 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-15 09:55:54,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:55:56,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:56:06,623 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-15 09:56:11,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:56:18,029 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-15 09:56:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:56:18,057 INFO L93 Difference]: Finished difference Result 265 states and 310 transitions. [2022-04-15 09:56:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 09:56:18,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-15 09:56:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:56:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 09:56:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-15 09:56:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 09:56:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2022-04-15 09:56:18,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 105 transitions. [2022-04-15 09:56:31,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 101 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 09:56:31,730 INFO L225 Difference]: With dead ends: 265 [2022-04-15 09:56:31,730 INFO L226 Difference]: Without dead ends: 263 [2022-04-15 09:56:31,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=108, Invalid=393, Unknown=5, NotChecked=0, Total=506 [2022-04-15 09:56:31,731 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 42.4s IncrementalHoareTripleChecker+Time [2022-04-15 09:56:31,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 230 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 11 Unknown, 81 Unchecked, 42.4s Time] [2022-04-15 09:56:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-15 09:56:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2022-04-15 09:56:32,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:56:32,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-15 09:56:32,064 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-15 09:56:32,065 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-15 09:56:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:56:32,068 INFO L93 Difference]: Finished difference Result 263 states and 308 transitions. [2022-04-15 09:56:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 308 transitions. [2022-04-15 09:56:32,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:56:32,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:56:32,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 263 states. [2022-04-15 09:56:32,070 INFO L87 Difference]: Start difference. First operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 263 states. [2022-04-15 09:56:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:56:32,073 INFO L93 Difference]: Finished difference Result 263 states and 308 transitions. [2022-04-15 09:56:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 308 transitions. [2022-04-15 09:56:32,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:56:32,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:56:32,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:56:32,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:56:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 177 states have internal predecessors, (198), 52 states have call successors, (52), 34 states have call predecessors, (52), 33 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-15 09:56:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2022-04-15 09:56:32,078 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 99 [2022-04-15 09:56:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:56:32,078 INFO L478 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2022-04-15 09:56:32,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 09:56:32,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 300 transitions. [2022-04-15 09:56:32,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:56:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2022-04-15 09:56:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 09:56:32,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:56:32,615 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:56:32,632 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-15 09:56:32,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:56:32,816 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:56:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:56:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-15 09:56:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:56:32,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332228387] [2022-04-15 09:56:34,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:56:34,955 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:56:34,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:56:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-15 09:56:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:56:34,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964130258] [2022-04-15 09:56:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:56:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:56:34,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:56:34,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10090801] [2022-04-15 09:56:34,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:56:34,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:56:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:56:34,966 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-15 09:56:34,969 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-15 09:56:35,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:56:35,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:56:35,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:56:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:56:35,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:56:35,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {24814#true} call ULTIMATE.init(); {24814#true} is VALID [2022-04-15 09:56:35,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {24814#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; {24814#true} is VALID [2022-04-15 09:56:35,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24814#true} {24814#true} #92#return; {24814#true} is VALID [2022-04-15 09:56:35,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {24814#true} call #t~ret7 := main(); {24814#true} is VALID [2022-04-15 09:56:35,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {24814#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; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {24834#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #78#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,413 INFO L272 TraceCheckUtils]: 13: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,414 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #80#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,414 INFO L272 TraceCheckUtils]: 18: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,415 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #82#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {24834#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {24834#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,415 INFO L272 TraceCheckUtils]: 26: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #78#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,416 INFO L272 TraceCheckUtils]: 31: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,417 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #80#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,417 INFO L272 TraceCheckUtils]: 36: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,417 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #82#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {24834#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {24834#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,418 INFO L272 TraceCheckUtils]: 44: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,419 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #78#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,419 INFO L272 TraceCheckUtils]: 49: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,420 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #80#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,420 INFO L272 TraceCheckUtils]: 54: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,420 INFO L290 TraceCheckUtils]: 56: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,420 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #82#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {24834#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {24834#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 61: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,421 INFO L272 TraceCheckUtils]: 62: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,422 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #84#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,422 INFO L272 TraceCheckUtils]: 67: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,423 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #86#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {24834#(= 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); {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,423 INFO L290 TraceCheckUtils]: 73: Hoare triple {24834#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,423 INFO L290 TraceCheckUtils]: 74: Hoare triple {24834#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,424 INFO L290 TraceCheckUtils]: 75: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,424 INFO L272 TraceCheckUtils]: 76: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,424 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #84#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,424 INFO L272 TraceCheckUtils]: 81: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:56:35,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:56:35,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:56:35,425 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24814#true} {24834#(= main_~B~0 1)} #86#return; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {24834#(= 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); {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,426 INFO L290 TraceCheckUtils]: 87: Hoare triple {24834#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {24834#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {24834#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24834#(= main_~B~0 1)} is VALID [2022-04-15 09:56:35,426 INFO L272 TraceCheckUtils]: 90: Hoare triple {24834#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:56:35,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {24814#true} ~cond := #in~cond; {25093#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:56:35,427 INFO L290 TraceCheckUtils]: 92: Hoare triple {25093#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:56:35,427 INFO L290 TraceCheckUtils]: 93: Hoare triple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:56:35,428 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} {24834#(= main_~B~0 1)} #84#return; {25104#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-15 09:56:35,428 INFO L272 TraceCheckUtils]: 95: Hoare triple {25104#(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)); {24814#true} is VALID [2022-04-15 09:56:35,428 INFO L290 TraceCheckUtils]: 96: Hoare triple {24814#true} ~cond := #in~cond; {25093#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:56:35,428 INFO L290 TraceCheckUtils]: 97: Hoare triple {25093#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:56:35,428 INFO L290 TraceCheckUtils]: 98: Hoare triple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:56:35,430 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} {25104#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25120#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-15 09:56:35,430 INFO L290 TraceCheckUtils]: 100: Hoare triple {25120#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25124#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-15 09:56:35,431 INFO L272 TraceCheckUtils]: 101: Hoare triple {25124#(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)); {25128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:56:35,431 INFO L290 TraceCheckUtils]: 102: Hoare triple {25128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:56:35,431 INFO L290 TraceCheckUtils]: 103: Hoare triple {25132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24815#false} is VALID [2022-04-15 09:56:35,431 INFO L290 TraceCheckUtils]: 104: Hoare triple {24815#false} assume !false; {24815#false} is VALID [2022-04-15 09:56:35,432 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-15 09:56:35,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:10,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {24815#false} assume !false; {24815#false} is VALID [2022-04-15 09:57:10,967 INFO L290 TraceCheckUtils]: 103: Hoare triple {25132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24815#false} is VALID [2022-04-15 09:57:10,967 INFO L290 TraceCheckUtils]: 102: Hoare triple {25128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:57:10,968 INFO L272 TraceCheckUtils]: 101: Hoare triple {25148#(= (+ (* 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)); {25128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:57:10,968 INFO L290 TraceCheckUtils]: 100: Hoare triple {25152#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {25148#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:57:10,970 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} {25156#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #86#return; {25152#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-15 09:57:10,971 INFO L290 TraceCheckUtils]: 98: Hoare triple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:57:10,971 INFO L290 TraceCheckUtils]: 97: Hoare triple {25166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:57:10,971 INFO L290 TraceCheckUtils]: 96: Hoare triple {24814#true} ~cond := #in~cond; {25166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:57:10,971 INFO L272 TraceCheckUtils]: 95: Hoare triple {25156#(= (+ (* 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)); {24814#true} is VALID [2022-04-15 09:57:10,972 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} {24814#true} #84#return; {25156#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 09:57:10,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {25166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25097#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 91: Hoare triple {24814#true} ~cond := #in~cond; {25166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:57:10,973 INFO L272 TraceCheckUtils]: 90: Hoare triple {24814#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 89: Hoare triple {24814#true} assume !!(#t~post6 < 50);havoc #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 88: Hoare triple {24814#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 87: Hoare triple {24814#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 86: Hoare triple {24814#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); {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24814#true} {24814#true} #86#return; {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 84: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,973 INFO L290 TraceCheckUtils]: 83: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 82: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L272 TraceCheckUtils]: 81: Hoare triple {24814#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24814#true} {24814#true} #84#return; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L272 TraceCheckUtils]: 76: Hoare triple {24814#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 75: Hoare triple {24814#true} assume !!(#t~post6 < 50);havoc #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 74: Hoare triple {24814#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {24814#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {24814#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); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24814#true} {24814#true} #86#return; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 69: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,974 INFO L290 TraceCheckUtils]: 68: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L272 TraceCheckUtils]: 67: Hoare triple {24814#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24814#true} {24814#true} #84#return; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L272 TraceCheckUtils]: 62: Hoare triple {24814#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {24814#true} assume !!(#t~post6 < 50);havoc #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {24814#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {24814#true} assume !(~r~0 >= ~d~0); {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24814#true} {24814#true} #82#return; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L272 TraceCheckUtils]: 54: Hoare triple {24814#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24814#true} {24814#true} #80#return; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L272 TraceCheckUtils]: 49: Hoare triple {24814#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24814#true} {24814#true} #78#return; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L272 TraceCheckUtils]: 44: Hoare triple {24814#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {24814#true} assume !!(#t~post5 < 50);havoc #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {24814#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {24814#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24814#true} {24814#true} #82#return; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L272 TraceCheckUtils]: 36: Hoare triple {24814#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24814#true} {24814#true} #80#return; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L272 TraceCheckUtils]: 31: Hoare triple {24814#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24814#true} {24814#true} #78#return; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L272 TraceCheckUtils]: 26: Hoare triple {24814#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {24814#true} assume !!(#t~post5 < 50);havoc #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {24814#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {24814#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24814#true} {24814#true} #82#return; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L272 TraceCheckUtils]: 18: Hoare triple {24814#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24814#true} {24814#true} #80#return; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,978 INFO L272 TraceCheckUtils]: 13: Hoare triple {24814#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24814#true} {24814#true} #78#return; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {24814#true} assume !(0 == ~cond); {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {24814#true} ~cond := #in~cond; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L272 TraceCheckUtils]: 8: Hoare triple {24814#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {24814#true} assume !!(#t~post5 < 50);havoc #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {24814#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {24814#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; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {24814#true} call #t~ret7 := main(); {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24814#true} {24814#true} #92#return; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {24814#true} assume true; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {24814#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; {24814#true} is VALID [2022-04-15 09:57:10,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {24814#true} call ULTIMATE.init(); {24814#true} is VALID [2022-04-15 09:57:10,980 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-15 09:57:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:10,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964130258] [2022-04-15 09:57:10,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:10,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10090801] [2022-04-15 09:57:10,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10090801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:10,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-15 09:57:10,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:10,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332228387] [2022-04-15 09:57:10,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332228387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:10,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:10,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:57:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377482183] [2022-04-15 09:57:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:10,981 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-15 09:57:10,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:10,981 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-15 09:57:11,015 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-15 09:57:11,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:57:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:57:11,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:57:11,016 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 09:57:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:12,106 INFO L93 Difference]: Finished difference Result 275 states and 316 transitions. [2022-04-15 09:57:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:57:12,106 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-15 09:57:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:12,106 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-15 09:57:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 09:57:12,107 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-15 09:57:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 09:57:12,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-15 09:57:12,203 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-15 09:57:12,207 INFO L225 Difference]: With dead ends: 275 [2022-04-15 09:57:12,208 INFO L226 Difference]: Without dead ends: 270 [2022-04-15 09:57:12,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:57:12,209 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:12,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:57:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-15 09:57:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-04-15 09:57:12,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:12,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:57:12,566 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:57:12,567 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:57:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:12,571 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2022-04-15 09:57:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-04-15 09:57:12,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:12,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:12,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 270 states. [2022-04-15 09:57:12,572 INFO L87 Difference]: Start difference. First operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 270 states. [2022-04-15 09:57:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:12,576 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2022-04-15 09:57:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2022-04-15 09:57:12,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:12,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:12,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:12,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 170 states have (on average 1.111764705882353) internal successors, (189), 175 states have internal predecessors, (189), 47 states have call successors, (47), 36 states have call predecessors, (47), 35 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:57:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2022-04-15 09:57:12,581 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 105 [2022-04-15 09:57:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:12,581 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2022-04-15 09:57:12,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 09:57:12,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 281 transitions. [2022-04-15 09:57:13,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:57:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2022-04-15 09:57:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 09:57:13,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:13,121 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:13,153 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-15 09:57:13,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 09:57:13,322 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 7 times [2022-04-15 09:57:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:13,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621287048] [2022-04-15 09:57:17,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:17,418 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:17,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 8 times [2022-04-15 09:57:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358957668] [2022-04-15 09:57:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:17,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:17,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21369478] [2022-04-15 09:57:17,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:57:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:17,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:17,433 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-15 09:57:17,476 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-15 09:57:17,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:57:17,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:17,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:57:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:17,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:18,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {27061#true} call ULTIMATE.init(); {27061#true} is VALID [2022-04-15 09:57:18,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {27061#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; {27069#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:18,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {27069#(<= ~counter~0 0)} assume true; {27069#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:18,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27069#(<= ~counter~0 0)} {27061#true} #92#return; {27069#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:18,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {27069#(<= ~counter~0 0)} call #t~ret7 := main(); {27069#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:18,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {27069#(<= ~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; {27069#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:18,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {27069#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {27085#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,203 INFO L272 TraceCheckUtils]: 8: Hoare triple {27085#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {27085#(<= ~counter~0 1)} ~cond := #in~cond; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {27085#(<= ~counter~0 1)} assume !(0 == ~cond); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {27085#(<= ~counter~0 1)} assume true; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,205 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27085#(<= ~counter~0 1)} {27085#(<= ~counter~0 1)} #78#return; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {27085#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {27085#(<= ~counter~0 1)} ~cond := #in~cond; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {27085#(<= ~counter~0 1)} assume !(0 == ~cond); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {27085#(<= ~counter~0 1)} assume true; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,206 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27085#(<= ~counter~0 1)} {27085#(<= ~counter~0 1)} #80#return; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,207 INFO L272 TraceCheckUtils]: 18: Hoare triple {27085#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {27085#(<= ~counter~0 1)} ~cond := #in~cond; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {27085#(<= ~counter~0 1)} assume !(0 == ~cond); {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {27085#(<= ~counter~0 1)} assume true; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,208 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27085#(<= ~counter~0 1)} {27085#(<= ~counter~0 1)} #82#return; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {27085#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27085#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:18,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {27085#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {27140#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,210 INFO L272 TraceCheckUtils]: 26: Hoare triple {27140#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {27140#(<= ~counter~0 2)} ~cond := #in~cond; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {27140#(<= ~counter~0 2)} assume !(0 == ~cond); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {27140#(<= ~counter~0 2)} assume true; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,211 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27140#(<= ~counter~0 2)} {27140#(<= ~counter~0 2)} #78#return; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,211 INFO L272 TraceCheckUtils]: 31: Hoare triple {27140#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {27140#(<= ~counter~0 2)} ~cond := #in~cond; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {27140#(<= ~counter~0 2)} assume !(0 == ~cond); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {27140#(<= ~counter~0 2)} assume true; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,213 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27140#(<= ~counter~0 2)} {27140#(<= ~counter~0 2)} #80#return; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,213 INFO L272 TraceCheckUtils]: 36: Hoare triple {27140#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {27140#(<= ~counter~0 2)} ~cond := #in~cond; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {27140#(<= ~counter~0 2)} assume !(0 == ~cond); {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {27140#(<= ~counter~0 2)} assume true; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,214 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27140#(<= ~counter~0 2)} {27140#(<= ~counter~0 2)} #82#return; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {27140#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27140#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:18,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {27140#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {27195#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,216 INFO L272 TraceCheckUtils]: 44: Hoare triple {27195#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {27195#(<= ~counter~0 3)} ~cond := #in~cond; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {27195#(<= ~counter~0 3)} assume !(0 == ~cond); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {27195#(<= ~counter~0 3)} assume true; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,218 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27195#(<= ~counter~0 3)} {27195#(<= ~counter~0 3)} #78#return; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,218 INFO L272 TraceCheckUtils]: 49: Hoare triple {27195#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {27195#(<= ~counter~0 3)} ~cond := #in~cond; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {27195#(<= ~counter~0 3)} assume !(0 == ~cond); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {27195#(<= ~counter~0 3)} assume true; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,219 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27195#(<= ~counter~0 3)} {27195#(<= ~counter~0 3)} #80#return; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,220 INFO L272 TraceCheckUtils]: 54: Hoare triple {27195#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {27195#(<= ~counter~0 3)} ~cond := #in~cond; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {27195#(<= ~counter~0 3)} assume !(0 == ~cond); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {27195#(<= ~counter~0 3)} assume true; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,221 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27195#(<= ~counter~0 3)} {27195#(<= ~counter~0 3)} #82#return; {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {27195#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {27195#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:18,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {27195#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {27250#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,223 INFO L272 TraceCheckUtils]: 62: Hoare triple {27250#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {27250#(<= ~counter~0 4)} ~cond := #in~cond; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {27250#(<= ~counter~0 4)} assume !(0 == ~cond); {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {27250#(<= ~counter~0 4)} assume true; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,224 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27250#(<= ~counter~0 4)} {27250#(<= ~counter~0 4)} #84#return; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,225 INFO L272 TraceCheckUtils]: 67: Hoare triple {27250#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {27250#(<= ~counter~0 4)} ~cond := #in~cond; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {27250#(<= ~counter~0 4)} assume !(0 == ~cond); {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,226 INFO L290 TraceCheckUtils]: 70: Hoare triple {27250#(<= ~counter~0 4)} assume true; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,226 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27250#(<= ~counter~0 4)} {27250#(<= ~counter~0 4)} #86#return; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {27250#(<= ~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); {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {27250#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27250#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:18,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {27250#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {27293#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,228 INFO L272 TraceCheckUtils]: 76: Hoare triple {27293#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {27293#(<= ~counter~0 5)} ~cond := #in~cond; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,229 INFO L290 TraceCheckUtils]: 78: Hoare triple {27293#(<= ~counter~0 5)} assume !(0 == ~cond); {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {27293#(<= ~counter~0 5)} assume true; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,230 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27293#(<= ~counter~0 5)} {27293#(<= ~counter~0 5)} #84#return; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,230 INFO L272 TraceCheckUtils]: 81: Hoare triple {27293#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {27293#(<= ~counter~0 5)} ~cond := #in~cond; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,231 INFO L290 TraceCheckUtils]: 83: Hoare triple {27293#(<= ~counter~0 5)} assume !(0 == ~cond); {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,231 INFO L290 TraceCheckUtils]: 84: Hoare triple {27293#(<= ~counter~0 5)} assume true; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,231 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27293#(<= ~counter~0 5)} {27293#(<= ~counter~0 5)} #86#return; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,232 INFO L290 TraceCheckUtils]: 86: Hoare triple {27293#(<= ~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); {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,232 INFO L290 TraceCheckUtils]: 87: Hoare triple {27293#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27293#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:18,233 INFO L290 TraceCheckUtils]: 88: Hoare triple {27293#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,233 INFO L290 TraceCheckUtils]: 89: Hoare triple {27336#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,234 INFO L272 TraceCheckUtils]: 90: Hoare triple {27336#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,234 INFO L290 TraceCheckUtils]: 91: Hoare triple {27336#(<= ~counter~0 6)} ~cond := #in~cond; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,234 INFO L290 TraceCheckUtils]: 92: Hoare triple {27336#(<= ~counter~0 6)} assume !(0 == ~cond); {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {27336#(<= ~counter~0 6)} assume true; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,235 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27336#(<= ~counter~0 6)} {27336#(<= ~counter~0 6)} #84#return; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,236 INFO L272 TraceCheckUtils]: 95: Hoare triple {27336#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {27336#(<= ~counter~0 6)} ~cond := #in~cond; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {27336#(<= ~counter~0 6)} assume !(0 == ~cond); {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,236 INFO L290 TraceCheckUtils]: 98: Hoare triple {27336#(<= ~counter~0 6)} assume true; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,237 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27336#(<= ~counter~0 6)} {27336#(<= ~counter~0 6)} #86#return; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,237 INFO L290 TraceCheckUtils]: 100: Hoare triple {27336#(<= ~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); {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,237 INFO L290 TraceCheckUtils]: 101: Hoare triple {27336#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27336#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:18,238 INFO L290 TraceCheckUtils]: 102: Hoare triple {27336#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27379#(<= |main_#t~post6| 6)} is VALID [2022-04-15 09:57:18,238 INFO L290 TraceCheckUtils]: 103: Hoare triple {27379#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {27062#false} is VALID [2022-04-15 09:57:18,238 INFO L272 TraceCheckUtils]: 104: Hoare triple {27062#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27062#false} is VALID [2022-04-15 09:57:18,238 INFO L290 TraceCheckUtils]: 105: Hoare triple {27062#false} ~cond := #in~cond; {27062#false} is VALID [2022-04-15 09:57:18,238 INFO L290 TraceCheckUtils]: 106: Hoare triple {27062#false} assume 0 == ~cond; {27062#false} is VALID [2022-04-15 09:57:18,238 INFO L290 TraceCheckUtils]: 107: Hoare triple {27062#false} assume !false; {27062#false} is VALID [2022-04-15 09:57:18,239 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-15 09:57:18,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:18,827 INFO L290 TraceCheckUtils]: 107: Hoare triple {27062#false} assume !false; {27062#false} is VALID [2022-04-15 09:57:18,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {27062#false} assume 0 == ~cond; {27062#false} is VALID [2022-04-15 09:57:18,827 INFO L290 TraceCheckUtils]: 105: Hoare triple {27062#false} ~cond := #in~cond; {27062#false} is VALID [2022-04-15 09:57:18,827 INFO L272 TraceCheckUtils]: 104: Hoare triple {27062#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27062#false} is VALID [2022-04-15 09:57:18,828 INFO L290 TraceCheckUtils]: 103: Hoare triple {27407#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {27062#false} is VALID [2022-04-15 09:57:18,828 INFO L290 TraceCheckUtils]: 102: Hoare triple {27411#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27407#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:57:18,828 INFO L290 TraceCheckUtils]: 101: Hoare triple {27411#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {27411#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,829 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27061#true} {27411#(< ~counter~0 50)} #86#return; {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,829 INFO L290 TraceCheckUtils]: 98: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,829 INFO L290 TraceCheckUtils]: 97: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,829 INFO L290 TraceCheckUtils]: 96: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,829 INFO L272 TraceCheckUtils]: 95: Hoare triple {27411#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,830 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27061#true} {27411#(< ~counter~0 50)} #84#return; {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,830 INFO L290 TraceCheckUtils]: 91: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,830 INFO L272 TraceCheckUtils]: 90: Hoare triple {27411#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {27411#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {27454#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27411#(< ~counter~0 50)} is VALID [2022-04-15 09:57:18,832 INFO L290 TraceCheckUtils]: 87: Hoare triple {27454#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,832 INFO L290 TraceCheckUtils]: 86: Hoare triple {27454#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,832 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27061#true} {27454#(< ~counter~0 49)} #86#return; {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 83: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 82: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L272 TraceCheckUtils]: 81: Hoare triple {27454#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27061#true} {27454#(< ~counter~0 49)} #84#return; {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 79: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 78: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,834 INFO L272 TraceCheckUtils]: 76: Hoare triple {27454#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {27454#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,835 INFO L290 TraceCheckUtils]: 74: Hoare triple {27497#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27454#(< ~counter~0 49)} is VALID [2022-04-15 09:57:18,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {27497#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {27497#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,836 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27061#true} {27497#(< ~counter~0 48)} #86#return; {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,836 INFO L272 TraceCheckUtils]: 67: Hoare triple {27497#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,837 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27061#true} {27497#(< ~counter~0 48)} #84#return; {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,837 INFO L272 TraceCheckUtils]: 62: Hoare triple {27497#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {27497#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {27540#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27497#(< ~counter~0 48)} is VALID [2022-04-15 09:57:18,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {27540#(< ~counter~0 47)} assume !(~r~0 >= ~d~0); {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,839 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27061#true} {27540#(< ~counter~0 47)} #82#return; {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,839 INFO L272 TraceCheckUtils]: 54: Hoare triple {27540#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,839 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27061#true} {27540#(< ~counter~0 47)} #80#return; {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L272 TraceCheckUtils]: 49: Hoare triple {27540#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27061#true} {27540#(< ~counter~0 47)} #78#return; {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,840 INFO L272 TraceCheckUtils]: 44: Hoare triple {27540#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {27540#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {27595#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27540#(< ~counter~0 47)} is VALID [2022-04-15 09:57:18,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {27595#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,842 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27061#true} {27595#(< ~counter~0 46)} #82#return; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,842 INFO L272 TraceCheckUtils]: 36: Hoare triple {27595#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,843 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27061#true} {27595#(< ~counter~0 46)} #80#return; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,843 INFO L272 TraceCheckUtils]: 31: Hoare triple {27595#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,843 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27061#true} {27595#(< ~counter~0 46)} #78#return; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,844 INFO L272 TraceCheckUtils]: 26: Hoare triple {27595#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {27595#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {27650#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27595#(< ~counter~0 46)} is VALID [2022-04-15 09:57:18,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {27650#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,846 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27061#true} {27650#(< ~counter~0 45)} #82#return; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {27650#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27061#true} {27650#(< ~counter~0 45)} #80#return; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L272 TraceCheckUtils]: 13: Hoare triple {27650#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27061#true} {27650#(< ~counter~0 45)} #78#return; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {27061#true} assume true; {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {27061#true} assume !(0 == ~cond); {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {27061#true} ~cond := #in~cond; {27061#true} is VALID [2022-04-15 09:57:18,847 INFO L272 TraceCheckUtils]: 8: Hoare triple {27650#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27061#true} is VALID [2022-04-15 09:57:18,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {27650#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {27705#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27650#(< ~counter~0 45)} is VALID [2022-04-15 09:57:18,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {27705#(< ~counter~0 44)} 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; {27705#(< ~counter~0 44)} is VALID [2022-04-15 09:57:18,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {27705#(< ~counter~0 44)} call #t~ret7 := main(); {27705#(< ~counter~0 44)} is VALID [2022-04-15 09:57:18,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27705#(< ~counter~0 44)} {27061#true} #92#return; {27705#(< ~counter~0 44)} is VALID [2022-04-15 09:57:18,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {27705#(< ~counter~0 44)} assume true; {27705#(< ~counter~0 44)} is VALID [2022-04-15 09:57:18,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {27061#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; {27705#(< ~counter~0 44)} is VALID [2022-04-15 09:57:18,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {27061#true} call ULTIMATE.init(); {27061#true} is VALID [2022-04-15 09:57:18,851 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-15 09:57:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358957668] [2022-04-15 09:57:18,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21369478] [2022-04-15 09:57:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21369478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:18,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:57:18,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621287048] [2022-04-15 09:57:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621287048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:18,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:18,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:57:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886640989] [2022-04-15 09:57:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:18,852 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-15 09:57:18,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:18,852 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-15 09:57:18,921 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-15 09:57:18,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:57:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:57:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:57:18,922 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-15 09:57:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:20,056 INFO L93 Difference]: Finished difference Result 333 states and 370 transitions. [2022-04-15 09:57:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 09:57:20,056 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-15 09:57:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:20,056 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-15 09:57:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-15 09:57:20,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-15 09:57:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-15 09:57:20,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2022-04-15 09:57:20,186 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-15 09:57:20,191 INFO L225 Difference]: With dead ends: 333 [2022-04-15 09:57:20,191 INFO L226 Difference]: Without dead ends: 320 [2022-04-15 09:57:20,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=253, Unknown=0, NotChecked=0, Total=420 [2022-04-15 09:57:20,192 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 43 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:20,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 214 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:57:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-04-15 09:57:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2022-04-15 09:57:20,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:20,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:20,562 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:20,562 INFO L87 Difference]: Start difference. First operand 320 states. Second operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:20,567 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2022-04-15 09:57:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2022-04-15 09:57:20,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:20,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:20,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 320 states. [2022-04-15 09:57:20,568 INFO L87 Difference]: Start difference. First operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 320 states. [2022-04-15 09:57:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:20,572 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2022-04-15 09:57:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 350 transitions. [2022-04-15 09:57:20,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:20,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:20,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:20,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 220 states have (on average 1.1045454545454545) internal successors, (243), 224 states have internal predecessors, (243), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 349 transitions. [2022-04-15 09:57:20,578 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 349 transitions. Word has length 108 [2022-04-15 09:57:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:20,579 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 349 transitions. [2022-04-15 09:57:20,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-15 09:57:20,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 319 states and 349 transitions. [2022-04-15 09:57:21,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:57:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 349 transitions. [2022-04-15 09:57:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 09:57:21,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:21,389 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:21,428 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-15 09:57:21,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 09:57:21,589 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 1 times [2022-04-15 09:57:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:21,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195541875] [2022-04-15 09:57:24,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:24,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:24,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 2 times [2022-04-15 09:57:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:24,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404991785] [2022-04-15 09:57:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:24,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:24,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954018124] [2022-04-15 09:57:24,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:57:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:24,232 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-15 09:57:24,233 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-15 09:57:24,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:57:24,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:24,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:57:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:24,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:24,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {29676#true} call ULTIMATE.init(); {29676#true} is VALID [2022-04-15 09:57:24,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {29676#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; {29684#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:24,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {29684#(<= ~counter~0 0)} assume true; {29684#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:24,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29684#(<= ~counter~0 0)} {29676#true} #92#return; {29684#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:24,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {29684#(<= ~counter~0 0)} call #t~ret7 := main(); {29684#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:24,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {29684#(<= ~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; {29684#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:24,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {29684#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {29700#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {29700#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {29700#(<= ~counter~0 1)} ~cond := #in~cond; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {29700#(<= ~counter~0 1)} assume !(0 == ~cond); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {29700#(<= ~counter~0 1)} assume true; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,859 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29700#(<= ~counter~0 1)} {29700#(<= ~counter~0 1)} #78#return; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,859 INFO L272 TraceCheckUtils]: 13: Hoare triple {29700#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {29700#(<= ~counter~0 1)} ~cond := #in~cond; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {29700#(<= ~counter~0 1)} assume !(0 == ~cond); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {29700#(<= ~counter~0 1)} assume true; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,861 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29700#(<= ~counter~0 1)} {29700#(<= ~counter~0 1)} #80#return; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,861 INFO L272 TraceCheckUtils]: 18: Hoare triple {29700#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {29700#(<= ~counter~0 1)} ~cond := #in~cond; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {29700#(<= ~counter~0 1)} assume !(0 == ~cond); {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {29700#(<= ~counter~0 1)} assume true; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,862 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29700#(<= ~counter~0 1)} {29700#(<= ~counter~0 1)} #82#return; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {29700#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29700#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:24,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {29700#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {29755#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,864 INFO L272 TraceCheckUtils]: 26: Hoare triple {29755#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {29755#(<= ~counter~0 2)} ~cond := #in~cond; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {29755#(<= ~counter~0 2)} assume !(0 == ~cond); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {29755#(<= ~counter~0 2)} assume true; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,866 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29755#(<= ~counter~0 2)} {29755#(<= ~counter~0 2)} #78#return; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,866 INFO L272 TraceCheckUtils]: 31: Hoare triple {29755#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {29755#(<= ~counter~0 2)} ~cond := #in~cond; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {29755#(<= ~counter~0 2)} assume !(0 == ~cond); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {29755#(<= ~counter~0 2)} assume true; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,867 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29755#(<= ~counter~0 2)} {29755#(<= ~counter~0 2)} #80#return; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,868 INFO L272 TraceCheckUtils]: 36: Hoare triple {29755#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {29755#(<= ~counter~0 2)} ~cond := #in~cond; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {29755#(<= ~counter~0 2)} assume !(0 == ~cond); {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {29755#(<= ~counter~0 2)} assume true; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,869 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29755#(<= ~counter~0 2)} {29755#(<= ~counter~0 2)} #82#return; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {29755#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29755#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:24,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {29755#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {29810#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,871 INFO L272 TraceCheckUtils]: 44: Hoare triple {29810#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {29810#(<= ~counter~0 3)} ~cond := #in~cond; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {29810#(<= ~counter~0 3)} assume !(0 == ~cond); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {29810#(<= ~counter~0 3)} assume true; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,872 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29810#(<= ~counter~0 3)} {29810#(<= ~counter~0 3)} #78#return; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,873 INFO L272 TraceCheckUtils]: 49: Hoare triple {29810#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {29810#(<= ~counter~0 3)} ~cond := #in~cond; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {29810#(<= ~counter~0 3)} assume !(0 == ~cond); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {29810#(<= ~counter~0 3)} assume true; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,874 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29810#(<= ~counter~0 3)} {29810#(<= ~counter~0 3)} #80#return; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,875 INFO L272 TraceCheckUtils]: 54: Hoare triple {29810#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {29810#(<= ~counter~0 3)} ~cond := #in~cond; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {29810#(<= ~counter~0 3)} assume !(0 == ~cond); {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {29810#(<= ~counter~0 3)} assume true; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,876 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29810#(<= ~counter~0 3)} {29810#(<= ~counter~0 3)} #82#return; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {29810#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29810#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:24,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {29810#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {29865#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,878 INFO L272 TraceCheckUtils]: 62: Hoare triple {29865#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {29865#(<= ~counter~0 4)} ~cond := #in~cond; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {29865#(<= ~counter~0 4)} assume !(0 == ~cond); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {29865#(<= ~counter~0 4)} assume true; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,879 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29865#(<= ~counter~0 4)} {29865#(<= ~counter~0 4)} #78#return; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,879 INFO L272 TraceCheckUtils]: 67: Hoare triple {29865#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {29865#(<= ~counter~0 4)} ~cond := #in~cond; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {29865#(<= ~counter~0 4)} assume !(0 == ~cond); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {29865#(<= ~counter~0 4)} assume true; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,881 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29865#(<= ~counter~0 4)} {29865#(<= ~counter~0 4)} #80#return; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,881 INFO L272 TraceCheckUtils]: 72: Hoare triple {29865#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {29865#(<= ~counter~0 4)} ~cond := #in~cond; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,882 INFO L290 TraceCheckUtils]: 74: Hoare triple {29865#(<= ~counter~0 4)} assume !(0 == ~cond); {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {29865#(<= ~counter~0 4)} assume true; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,882 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29865#(<= ~counter~0 4)} {29865#(<= ~counter~0 4)} #82#return; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {29865#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29865#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:24,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {29865#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,884 INFO L290 TraceCheckUtils]: 79: Hoare triple {29920#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,884 INFO L272 TraceCheckUtils]: 80: Hoare triple {29920#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,885 INFO L290 TraceCheckUtils]: 81: Hoare triple {29920#(<= ~counter~0 5)} ~cond := #in~cond; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,885 INFO L290 TraceCheckUtils]: 82: Hoare triple {29920#(<= ~counter~0 5)} assume !(0 == ~cond); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,885 INFO L290 TraceCheckUtils]: 83: Hoare triple {29920#(<= ~counter~0 5)} assume true; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,886 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29920#(<= ~counter~0 5)} {29920#(<= ~counter~0 5)} #78#return; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,886 INFO L272 TraceCheckUtils]: 85: Hoare triple {29920#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,886 INFO L290 TraceCheckUtils]: 86: Hoare triple {29920#(<= ~counter~0 5)} ~cond := #in~cond; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,887 INFO L290 TraceCheckUtils]: 87: Hoare triple {29920#(<= ~counter~0 5)} assume !(0 == ~cond); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {29920#(<= ~counter~0 5)} assume true; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,887 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29920#(<= ~counter~0 5)} {29920#(<= ~counter~0 5)} #80#return; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,888 INFO L272 TraceCheckUtils]: 90: Hoare triple {29920#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,888 INFO L290 TraceCheckUtils]: 91: Hoare triple {29920#(<= ~counter~0 5)} ~cond := #in~cond; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {29920#(<= ~counter~0 5)} assume !(0 == ~cond); {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {29920#(<= ~counter~0 5)} assume true; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,889 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29920#(<= ~counter~0 5)} {29920#(<= ~counter~0 5)} #82#return; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,889 INFO L290 TraceCheckUtils]: 95: Hoare triple {29920#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29920#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {29920#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29975#(<= |main_#t~post5| 5)} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {29975#(<= |main_#t~post5| 5)} assume !(#t~post5 < 50);havoc #t~post5; {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 98: Hoare triple {29677#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 99: Hoare triple {29677#false} assume !!(#t~post6 < 50);havoc #t~post6; {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L272 TraceCheckUtils]: 100: Hoare triple {29677#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {29677#false} ~cond := #in~cond; {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {29677#false} assume !(0 == ~cond); {29677#false} is VALID [2022-04-15 09:57:24,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {29677#false} assume true; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29677#false} {29677#false} #84#return; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L272 TraceCheckUtils]: 105: Hoare triple {29677#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 106: Hoare triple {29677#false} ~cond := #in~cond; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 107: Hoare triple {29677#false} assume !(0 == ~cond); {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 108: Hoare triple {29677#false} assume true; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29677#false} {29677#false} #86#return; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {29677#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); {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 111: Hoare triple {29677#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 112: Hoare triple {29677#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 113: Hoare triple {29677#false} assume !(#t~post6 < 50);havoc #t~post6; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L272 TraceCheckUtils]: 114: Hoare triple {29677#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 115: Hoare triple {29677#false} ~cond := #in~cond; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 116: Hoare triple {29677#false} assume 0 == ~cond; {29677#false} is VALID [2022-04-15 09:57:24,891 INFO L290 TraceCheckUtils]: 117: Hoare triple {29677#false} assume !false; {29677#false} is VALID [2022-04-15 09:57:24,892 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-15 09:57:24,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:25,408 INFO L290 TraceCheckUtils]: 117: Hoare triple {29677#false} assume !false; {29677#false} is VALID [2022-04-15 09:57:25,408 INFO L290 TraceCheckUtils]: 116: Hoare triple {29677#false} assume 0 == ~cond; {29677#false} is VALID [2022-04-15 09:57:25,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {29677#false} ~cond := #in~cond; {29677#false} is VALID [2022-04-15 09:57:25,408 INFO L272 TraceCheckUtils]: 114: Hoare triple {29677#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29677#false} is VALID [2022-04-15 09:57:25,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {29677#false} assume !(#t~post6 < 50);havoc #t~post6; {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 112: Hoare triple {29677#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 111: Hoare triple {29677#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 110: Hoare triple {29677#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); {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29676#true} {29677#false} #86#return; {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 108: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 107: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 106: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L272 TraceCheckUtils]: 105: Hoare triple {29677#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29676#true} {29677#false} #84#return; {29677#false} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 102: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 101: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L272 TraceCheckUtils]: 100: Hoare triple {29677#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,409 INFO L290 TraceCheckUtils]: 99: Hoare triple {29677#false} assume !!(#t~post6 < 50);havoc #t~post6; {29677#false} is VALID [2022-04-15 09:57:25,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {29677#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29677#false} is VALID [2022-04-15 09:57:25,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {30099#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {29677#false} is VALID [2022-04-15 09:57:25,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {30103#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30099#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:57:25,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {30103#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,411 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29676#true} {30103#(< ~counter~0 50)} #82#return; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,411 INFO L290 TraceCheckUtils]: 93: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,411 INFO L290 TraceCheckUtils]: 92: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,411 INFO L290 TraceCheckUtils]: 91: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,411 INFO L272 TraceCheckUtils]: 90: Hoare triple {30103#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,411 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29676#true} {30103#(< ~counter~0 50)} #80#return; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,412 INFO L290 TraceCheckUtils]: 88: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,412 INFO L290 TraceCheckUtils]: 87: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,412 INFO L272 TraceCheckUtils]: 85: Hoare triple {30103#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,412 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29676#true} {30103#(< ~counter~0 50)} #78#return; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,425 INFO L272 TraceCheckUtils]: 80: Hoare triple {30103#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,442 INFO L290 TraceCheckUtils]: 79: Hoare triple {30103#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {30158#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30103#(< ~counter~0 50)} is VALID [2022-04-15 09:57:25,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {30158#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,444 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29676#true} {30158#(< ~counter~0 49)} #82#return; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,444 INFO L272 TraceCheckUtils]: 72: Hoare triple {30158#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,445 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29676#true} {30158#(< ~counter~0 49)} #80#return; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,445 INFO L290 TraceCheckUtils]: 68: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,445 INFO L272 TraceCheckUtils]: 67: Hoare triple {30158#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,445 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29676#true} {30158#(< ~counter~0 49)} #78#return; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,446 INFO L272 TraceCheckUtils]: 62: Hoare triple {30158#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {30158#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {30213#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30158#(< ~counter~0 49)} is VALID [2022-04-15 09:57:25,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {30213#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,447 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29676#true} {30213#(< ~counter~0 48)} #82#return; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L272 TraceCheckUtils]: 54: Hoare triple {30213#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29676#true} {30213#(< ~counter~0 48)} #80#return; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,448 INFO L272 TraceCheckUtils]: 49: Hoare triple {30213#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,449 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29676#true} {30213#(< ~counter~0 48)} #78#return; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,449 INFO L272 TraceCheckUtils]: 44: Hoare triple {30213#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {30213#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {30268#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30213#(< ~counter~0 48)} is VALID [2022-04-15 09:57:25,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {30268#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,450 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29676#true} {30268#(< ~counter~0 47)} #82#return; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L272 TraceCheckUtils]: 36: Hoare triple {30268#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29676#true} {30268#(< ~counter~0 47)} #80#return; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,451 INFO L272 TraceCheckUtils]: 31: Hoare triple {30268#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,452 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29676#true} {30268#(< ~counter~0 47)} #78#return; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,452 INFO L272 TraceCheckUtils]: 26: Hoare triple {30268#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {30268#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {30323#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30268#(< ~counter~0 47)} is VALID [2022-04-15 09:57:25,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {30323#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,453 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29676#true} {30323#(< ~counter~0 46)} #82#return; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L272 TraceCheckUtils]: 18: Hoare triple {30323#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29676#true} {30323#(< ~counter~0 46)} #80#return; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,454 INFO L272 TraceCheckUtils]: 13: Hoare triple {30323#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,455 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29676#true} {30323#(< ~counter~0 46)} #78#return; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {29676#true} assume true; {29676#true} is VALID [2022-04-15 09:57:25,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {29676#true} assume !(0 == ~cond); {29676#true} is VALID [2022-04-15 09:57:25,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {29676#true} ~cond := #in~cond; {29676#true} is VALID [2022-04-15 09:57:25,455 INFO L272 TraceCheckUtils]: 8: Hoare triple {30323#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29676#true} is VALID [2022-04-15 09:57:25,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {30323#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {30378#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30323#(< ~counter~0 46)} is VALID [2022-04-15 09:57:25,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {30378#(< ~counter~0 45)} 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; {30378#(< ~counter~0 45)} is VALID [2022-04-15 09:57:25,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {30378#(< ~counter~0 45)} call #t~ret7 := main(); {30378#(< ~counter~0 45)} is VALID [2022-04-15 09:57:25,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30378#(< ~counter~0 45)} {29676#true} #92#return; {30378#(< ~counter~0 45)} is VALID [2022-04-15 09:57:25,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {30378#(< ~counter~0 45)} assume true; {30378#(< ~counter~0 45)} is VALID [2022-04-15 09:57:25,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {29676#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; {30378#(< ~counter~0 45)} is VALID [2022-04-15 09:57:25,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {29676#true} call ULTIMATE.init(); {29676#true} is VALID [2022-04-15 09:57:25,458 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-15 09:57:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404991785] [2022-04-15 09:57:25,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954018124] [2022-04-15 09:57:25,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954018124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:25,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:25,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:57:25,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:25,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195541875] [2022-04-15 09:57:25,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195541875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:25,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:25,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:57:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784972690] [2022-04-15 09:57:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:25,460 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-15 09:57:25,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:25,460 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-15 09:57:25,543 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-15 09:57:25,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:57:25,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:25,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:57:25,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:57:25,545 INFO L87 Difference]: Start difference. First operand 319 states and 349 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-15 09:57:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:26,393 INFO L93 Difference]: Finished difference Result 372 states and 411 transitions. [2022-04-15 09:57:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 09:57:26,393 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-15 09:57:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:26,394 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-15 09:57:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-15 09:57:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-15 09:57:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-15 09:57:26,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-04-15 09:57:26,508 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-15 09:57:26,518 INFO L225 Difference]: With dead ends: 372 [2022-04-15 09:57:26,518 INFO L226 Difference]: Without dead ends: 317 [2022-04-15 09:57:26,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-15 09:57:26,522 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:26,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 178 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:57:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-15 09:57:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-04-15 09:57:27,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:27,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:27,011 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:27,011 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:27,015 INFO L93 Difference]: Finished difference Result 317 states and 346 transitions. [2022-04-15 09:57:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-15 09:57:27,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:27,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:27,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 317 states. [2022-04-15 09:57:27,016 INFO L87 Difference]: Start difference. First operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 317 states. [2022-04-15 09:57:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:27,020 INFO L93 Difference]: Finished difference Result 317 states and 346 transitions. [2022-04-15 09:57:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-15 09:57:27,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:27,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:27,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:27,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 218 states have (on average 1.1009174311926606) internal successors, (240), 222 states have internal predecessors, (240), 54 states have call successors, (54), 45 states have call predecessors, (54), 44 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-15 09:57:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 346 transitions. [2022-04-15 09:57:27,026 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 346 transitions. Word has length 118 [2022-04-15 09:57:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:27,027 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 346 transitions. [2022-04-15 09:57:27,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-15 09:57:27,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 346 transitions. [2022-04-15 09:57:27,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:57:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 346 transitions. [2022-04-15 09:57:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 09:57:27,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:27,830 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:27,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 09:57:28,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 09:57:28,030 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 9 times [2022-04-15 09:57:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:28,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371325906] [2022-04-15 09:57:30,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:30,119 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:30,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 10 times [2022-04-15 09:57:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040169987] [2022-04-15 09:57:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:30,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714922552] [2022-04-15 09:57:30,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:57:30,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:30,155 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-15 09:57:30,155 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-15 09:57:30,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:57:30,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:30,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 09:57:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:30,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:30,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {32421#true} call ULTIMATE.init(); {32421#true} is VALID [2022-04-15 09:57:30,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {32421#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; {32429#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:30,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {32429#(<= ~counter~0 0)} assume true; {32429#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:30,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32429#(<= ~counter~0 0)} {32421#true} #92#return; {32429#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:30,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {32429#(<= ~counter~0 0)} call #t~ret7 := main(); {32429#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:30,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {32429#(<= ~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; {32429#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:30,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {32429#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {32445#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,781 INFO L272 TraceCheckUtils]: 8: Hoare triple {32445#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {32445#(<= ~counter~0 1)} ~cond := #in~cond; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {32445#(<= ~counter~0 1)} assume !(0 == ~cond); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {32445#(<= ~counter~0 1)} assume true; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,782 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32445#(<= ~counter~0 1)} {32445#(<= ~counter~0 1)} #78#return; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,783 INFO L272 TraceCheckUtils]: 13: Hoare triple {32445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {32445#(<= ~counter~0 1)} ~cond := #in~cond; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {32445#(<= ~counter~0 1)} assume !(0 == ~cond); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {32445#(<= ~counter~0 1)} assume true; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,794 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32445#(<= ~counter~0 1)} {32445#(<= ~counter~0 1)} #80#return; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,794 INFO L272 TraceCheckUtils]: 18: Hoare triple {32445#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {32445#(<= ~counter~0 1)} ~cond := #in~cond; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {32445#(<= ~counter~0 1)} assume !(0 == ~cond); {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {32445#(<= ~counter~0 1)} assume true; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,796 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32445#(<= ~counter~0 1)} {32445#(<= ~counter~0 1)} #82#return; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {32445#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32445#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:30,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {32445#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {32500#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,797 INFO L272 TraceCheckUtils]: 26: Hoare triple {32500#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {32500#(<= ~counter~0 2)} ~cond := #in~cond; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {32500#(<= ~counter~0 2)} assume !(0 == ~cond); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {32500#(<= ~counter~0 2)} assume true; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,798 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32500#(<= ~counter~0 2)} {32500#(<= ~counter~0 2)} #78#return; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,799 INFO L272 TraceCheckUtils]: 31: Hoare triple {32500#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {32500#(<= ~counter~0 2)} ~cond := #in~cond; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {32500#(<= ~counter~0 2)} assume !(0 == ~cond); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {32500#(<= ~counter~0 2)} assume true; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,800 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32500#(<= ~counter~0 2)} {32500#(<= ~counter~0 2)} #80#return; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,800 INFO L272 TraceCheckUtils]: 36: Hoare triple {32500#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {32500#(<= ~counter~0 2)} ~cond := #in~cond; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {32500#(<= ~counter~0 2)} assume !(0 == ~cond); {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {32500#(<= ~counter~0 2)} assume true; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,801 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32500#(<= ~counter~0 2)} {32500#(<= ~counter~0 2)} #82#return; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {32500#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32500#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:30,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {32500#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {32555#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,803 INFO L272 TraceCheckUtils]: 44: Hoare triple {32555#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {32555#(<= ~counter~0 3)} ~cond := #in~cond; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {32555#(<= ~counter~0 3)} assume !(0 == ~cond); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {32555#(<= ~counter~0 3)} assume true; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,804 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32555#(<= ~counter~0 3)} {32555#(<= ~counter~0 3)} #78#return; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,804 INFO L272 TraceCheckUtils]: 49: Hoare triple {32555#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {32555#(<= ~counter~0 3)} ~cond := #in~cond; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {32555#(<= ~counter~0 3)} assume !(0 == ~cond); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {32555#(<= ~counter~0 3)} assume true; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,805 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32555#(<= ~counter~0 3)} {32555#(<= ~counter~0 3)} #80#return; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,805 INFO L272 TraceCheckUtils]: 54: Hoare triple {32555#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {32555#(<= ~counter~0 3)} ~cond := #in~cond; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {32555#(<= ~counter~0 3)} assume !(0 == ~cond); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {32555#(<= ~counter~0 3)} assume true; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,807 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32555#(<= ~counter~0 3)} {32555#(<= ~counter~0 3)} #82#return; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {32555#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:30,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {32555#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {32610#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,808 INFO L272 TraceCheckUtils]: 62: Hoare triple {32610#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {32610#(<= ~counter~0 4)} ~cond := #in~cond; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,808 INFO L290 TraceCheckUtils]: 64: Hoare triple {32610#(<= ~counter~0 4)} assume !(0 == ~cond); {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {32610#(<= ~counter~0 4)} assume true; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,809 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32610#(<= ~counter~0 4)} {32610#(<= ~counter~0 4)} #84#return; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,809 INFO L272 TraceCheckUtils]: 67: Hoare triple {32610#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {32610#(<= ~counter~0 4)} ~cond := #in~cond; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,810 INFO L290 TraceCheckUtils]: 69: Hoare triple {32610#(<= ~counter~0 4)} assume !(0 == ~cond); {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {32610#(<= ~counter~0 4)} assume true; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,811 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32610#(<= ~counter~0 4)} {32610#(<= ~counter~0 4)} #86#return; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {32610#(<= ~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); {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {32610#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32610#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:30,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {32610#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {32653#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,812 INFO L272 TraceCheckUtils]: 76: Hoare triple {32653#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {32653#(<= ~counter~0 5)} ~cond := #in~cond; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {32653#(<= ~counter~0 5)} assume !(0 == ~cond); {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {32653#(<= ~counter~0 5)} assume true; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,813 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32653#(<= ~counter~0 5)} {32653#(<= ~counter~0 5)} #84#return; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,814 INFO L272 TraceCheckUtils]: 81: Hoare triple {32653#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {32653#(<= ~counter~0 5)} ~cond := #in~cond; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {32653#(<= ~counter~0 5)} assume !(0 == ~cond); {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {32653#(<= ~counter~0 5)} assume true; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,815 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32653#(<= ~counter~0 5)} {32653#(<= ~counter~0 5)} #86#return; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,815 INFO L290 TraceCheckUtils]: 86: Hoare triple {32653#(<= ~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); {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,815 INFO L290 TraceCheckUtils]: 87: Hoare triple {32653#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32653#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:30,816 INFO L290 TraceCheckUtils]: 88: Hoare triple {32653#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,816 INFO L290 TraceCheckUtils]: 89: Hoare triple {32696#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,817 INFO L272 TraceCheckUtils]: 90: Hoare triple {32696#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,817 INFO L290 TraceCheckUtils]: 91: Hoare triple {32696#(<= ~counter~0 6)} ~cond := #in~cond; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,817 INFO L290 TraceCheckUtils]: 92: Hoare triple {32696#(<= ~counter~0 6)} assume !(0 == ~cond); {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,817 INFO L290 TraceCheckUtils]: 93: Hoare triple {32696#(<= ~counter~0 6)} assume true; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,818 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32696#(<= ~counter~0 6)} {32696#(<= ~counter~0 6)} #84#return; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,818 INFO L272 TraceCheckUtils]: 95: Hoare triple {32696#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {32696#(<= ~counter~0 6)} ~cond := #in~cond; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,819 INFO L290 TraceCheckUtils]: 97: Hoare triple {32696#(<= ~counter~0 6)} assume !(0 == ~cond); {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,819 INFO L290 TraceCheckUtils]: 98: Hoare triple {32696#(<= ~counter~0 6)} assume true; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,819 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32696#(<= ~counter~0 6)} {32696#(<= ~counter~0 6)} #86#return; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,819 INFO L290 TraceCheckUtils]: 100: Hoare triple {32696#(<= ~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); {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,820 INFO L290 TraceCheckUtils]: 101: Hoare triple {32696#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32696#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:30,820 INFO L290 TraceCheckUtils]: 102: Hoare triple {32696#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,820 INFO L290 TraceCheckUtils]: 103: Hoare triple {32739#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,821 INFO L272 TraceCheckUtils]: 104: Hoare triple {32739#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,821 INFO L290 TraceCheckUtils]: 105: Hoare triple {32739#(<= ~counter~0 7)} ~cond := #in~cond; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,821 INFO L290 TraceCheckUtils]: 106: Hoare triple {32739#(<= ~counter~0 7)} assume !(0 == ~cond); {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,822 INFO L290 TraceCheckUtils]: 107: Hoare triple {32739#(<= ~counter~0 7)} assume true; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,822 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32739#(<= ~counter~0 7)} {32739#(<= ~counter~0 7)} #84#return; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,822 INFO L272 TraceCheckUtils]: 109: Hoare triple {32739#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,823 INFO L290 TraceCheckUtils]: 110: Hoare triple {32739#(<= ~counter~0 7)} ~cond := #in~cond; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,823 INFO L290 TraceCheckUtils]: 111: Hoare triple {32739#(<= ~counter~0 7)} assume !(0 == ~cond); {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {32739#(<= ~counter~0 7)} assume true; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,824 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32739#(<= ~counter~0 7)} {32739#(<= ~counter~0 7)} #86#return; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,824 INFO L290 TraceCheckUtils]: 114: Hoare triple {32739#(<= ~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); {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,824 INFO L290 TraceCheckUtils]: 115: Hoare triple {32739#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32739#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:30,824 INFO L290 TraceCheckUtils]: 116: Hoare triple {32739#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32782#(<= |main_#t~post6| 7)} is VALID [2022-04-15 09:57:30,825 INFO L290 TraceCheckUtils]: 117: Hoare triple {32782#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {32422#false} is VALID [2022-04-15 09:57:30,825 INFO L272 TraceCheckUtils]: 118: Hoare triple {32422#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32422#false} is VALID [2022-04-15 09:57:30,825 INFO L290 TraceCheckUtils]: 119: Hoare triple {32422#false} ~cond := #in~cond; {32422#false} is VALID [2022-04-15 09:57:30,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {32422#false} assume 0 == ~cond; {32422#false} is VALID [2022-04-15 09:57:30,825 INFO L290 TraceCheckUtils]: 121: Hoare triple {32422#false} assume !false; {32422#false} is VALID [2022-04-15 09:57:30,825 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-15 09:57:30,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:31,333 INFO L290 TraceCheckUtils]: 121: Hoare triple {32422#false} assume !false; {32422#false} is VALID [2022-04-15 09:57:31,333 INFO L290 TraceCheckUtils]: 120: Hoare triple {32422#false} assume 0 == ~cond; {32422#false} is VALID [2022-04-15 09:57:31,333 INFO L290 TraceCheckUtils]: 119: Hoare triple {32422#false} ~cond := #in~cond; {32422#false} is VALID [2022-04-15 09:57:31,333 INFO L272 TraceCheckUtils]: 118: Hoare triple {32422#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32422#false} is VALID [2022-04-15 09:57:31,334 INFO L290 TraceCheckUtils]: 117: Hoare triple {32810#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {32422#false} is VALID [2022-04-15 09:57:31,334 INFO L290 TraceCheckUtils]: 116: Hoare triple {32814#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32810#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:57:31,335 INFO L290 TraceCheckUtils]: 115: Hoare triple {32814#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,335 INFO L290 TraceCheckUtils]: 114: Hoare triple {32814#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,335 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32421#true} {32814#(< ~counter~0 50)} #86#return; {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,335 INFO L290 TraceCheckUtils]: 112: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L290 TraceCheckUtils]: 110: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L272 TraceCheckUtils]: 109: Hoare triple {32814#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32421#true} {32814#(< ~counter~0 50)} #84#return; {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L290 TraceCheckUtils]: 106: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L290 TraceCheckUtils]: 105: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,336 INFO L272 TraceCheckUtils]: 104: Hoare triple {32814#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,337 INFO L290 TraceCheckUtils]: 103: Hoare triple {32814#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,338 INFO L290 TraceCheckUtils]: 102: Hoare triple {32857#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32814#(< ~counter~0 50)} is VALID [2022-04-15 09:57:31,338 INFO L290 TraceCheckUtils]: 101: Hoare triple {32857#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,338 INFO L290 TraceCheckUtils]: 100: Hoare triple {32857#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,338 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32421#true} {32857#(< ~counter~0 49)} #86#return; {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 98: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 97: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L272 TraceCheckUtils]: 95: Hoare triple {32857#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32421#true} {32857#(< ~counter~0 49)} #84#return; {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,339 INFO L272 TraceCheckUtils]: 90: Hoare triple {32857#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {32857#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {32900#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32857#(< ~counter~0 49)} is VALID [2022-04-15 09:57:31,340 INFO L290 TraceCheckUtils]: 87: Hoare triple {32900#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {32900#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,341 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32421#true} {32900#(< ~counter~0 48)} #86#return; {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,341 INFO L272 TraceCheckUtils]: 81: Hoare triple {32900#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,342 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32421#true} {32900#(< ~counter~0 48)} #84#return; {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,342 INFO L272 TraceCheckUtils]: 76: Hoare triple {32900#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {32900#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,343 INFO L290 TraceCheckUtils]: 74: Hoare triple {32943#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32900#(< ~counter~0 48)} is VALID [2022-04-15 09:57:31,343 INFO L290 TraceCheckUtils]: 73: Hoare triple {32943#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,343 INFO L290 TraceCheckUtils]: 72: Hoare triple {32943#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,344 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32421#true} {32943#(< ~counter~0 47)} #86#return; {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,344 INFO L272 TraceCheckUtils]: 67: Hoare triple {32943#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,344 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32421#true} {32943#(< ~counter~0 47)} #84#return; {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,345 INFO L290 TraceCheckUtils]: 64: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,345 INFO L290 TraceCheckUtils]: 63: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,345 INFO L272 TraceCheckUtils]: 62: Hoare triple {32943#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {32943#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {32986#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32943#(< ~counter~0 47)} is VALID [2022-04-15 09:57:31,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {32986#(< ~counter~0 46)} assume !(~r~0 >= ~d~0); {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,346 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32421#true} {32986#(< ~counter~0 46)} #82#return; {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,346 INFO L290 TraceCheckUtils]: 56: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,346 INFO L272 TraceCheckUtils]: 54: Hoare triple {32986#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,347 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32421#true} {32986#(< ~counter~0 46)} #80#return; {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,347 INFO L272 TraceCheckUtils]: 49: Hoare triple {32986#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,347 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32421#true} {32986#(< ~counter~0 46)} #78#return; {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,348 INFO L272 TraceCheckUtils]: 44: Hoare triple {32986#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {32986#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {33041#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32986#(< ~counter~0 46)} is VALID [2022-04-15 09:57:31,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {33041#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,349 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32421#true} {33041#(< ~counter~0 45)} #82#return; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L272 TraceCheckUtils]: 36: Hoare triple {33041#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32421#true} {33041#(< ~counter~0 45)} #80#return; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L272 TraceCheckUtils]: 31: Hoare triple {33041#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,350 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32421#true} {33041#(< ~counter~0 45)} #78#return; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,351 INFO L272 TraceCheckUtils]: 26: Hoare triple {33041#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {33041#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {33096#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33041#(< ~counter~0 45)} is VALID [2022-04-15 09:57:31,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {33096#(< ~counter~0 44)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,352 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32421#true} {33096#(< ~counter~0 44)} #82#return; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,353 INFO L272 TraceCheckUtils]: 18: Hoare triple {33096#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32421#true} {33096#(< ~counter~0 44)} #80#return; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L272 TraceCheckUtils]: 13: Hoare triple {33096#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32421#true} {33096#(< ~counter~0 44)} #78#return; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {32421#true} assume true; {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {32421#true} assume !(0 == ~cond); {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {32421#true} ~cond := #in~cond; {32421#true} is VALID [2022-04-15 09:57:31,372 INFO L272 TraceCheckUtils]: 8: Hoare triple {33096#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32421#true} is VALID [2022-04-15 09:57:31,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {33096#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {33151#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33096#(< ~counter~0 44)} is VALID [2022-04-15 09:57:31,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {33151#(< ~counter~0 43)} 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; {33151#(< ~counter~0 43)} is VALID [2022-04-15 09:57:31,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {33151#(< ~counter~0 43)} call #t~ret7 := main(); {33151#(< ~counter~0 43)} is VALID [2022-04-15 09:57:31,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33151#(< ~counter~0 43)} {32421#true} #92#return; {33151#(< ~counter~0 43)} is VALID [2022-04-15 09:57:31,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {33151#(< ~counter~0 43)} assume true; {33151#(< ~counter~0 43)} is VALID [2022-04-15 09:57:31,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {32421#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; {33151#(< ~counter~0 43)} is VALID [2022-04-15 09:57:31,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {32421#true} call ULTIMATE.init(); {32421#true} is VALID [2022-04-15 09:57:31,376 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-15 09:57:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040169987] [2022-04-15 09:57:31,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714922552] [2022-04-15 09:57:31,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714922552] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:31,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:31,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 09:57:31,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:31,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371325906] [2022-04-15 09:57:31,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371325906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:31,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:31,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:57:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547276422] [2022-04-15 09:57:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:31,378 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-15 09:57:31,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:31,378 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-15 09:57:31,464 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-15 09:57:31,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:57:31,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:57:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:57:31,464 INFO L87 Difference]: Start difference. First operand 317 states and 346 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:57:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:32,559 INFO L93 Difference]: Finished difference Result 413 states and 460 transitions. [2022-04-15 09:57:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 09:57:32,560 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-15 09:57:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:32,560 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-15 09:57:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-15 09:57:32,573 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-15 09:57:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-15 09:57:32,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-04-15 09:57:32,684 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-15 09:57:32,703 INFO L225 Difference]: With dead ends: 413 [2022-04-15 09:57:32,703 INFO L226 Difference]: Without dead ends: 400 [2022-04-15 09:57:32,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:57:32,703 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:32,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:57:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-15 09:57:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2022-04-15 09:57:33,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:33,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:33,067 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:33,067 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:33,077 INFO L93 Difference]: Finished difference Result 400 states and 440 transitions. [2022-04-15 09:57:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 440 transitions. [2022-04-15 09:57:33,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:33,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:33,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 400 states. [2022-04-15 09:57:33,079 INFO L87 Difference]: Start difference. First operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 400 states. [2022-04-15 09:57:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:33,085 INFO L93 Difference]: Finished difference Result 400 states and 440 transitions. [2022-04-15 09:57:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 440 transitions. [2022-04-15 09:57:33,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:33,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:33,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:33,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 275 states have (on average 1.1018181818181818) internal successors, (303), 280 states have internal predecessors, (303), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 439 transitions. [2022-04-15 09:57:33,094 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 439 transitions. Word has length 122 [2022-04-15 09:57:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:33,094 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 439 transitions. [2022-04-15 09:57:33,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:57:33,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 439 transitions. [2022-04-15 09:57:34,116 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-15 09:57:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 439 transitions. [2022-04-15 09:57:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 09:57:34,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:34,124 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:34,161 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-15 09:57:34,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:34,355 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 3 times [2022-04-15 09:57:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842295915] [2022-04-15 09:57:37,443 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:37,443 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:37,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 4 times [2022-04-15 09:57:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:37,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481476888] [2022-04-15 09:57:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:37,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832348357] [2022-04-15 09:57:37,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:57:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:37,455 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-15 09:57:37,458 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-15 09:57:37,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:57:37,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:37,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:37,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:38,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {35604#true} call ULTIMATE.init(); {35604#true} is VALID [2022-04-15 09:57:38,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {35604#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; {35612#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:38,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {35612#(<= ~counter~0 0)} assume true; {35612#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:38,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35612#(<= ~counter~0 0)} {35604#true} #92#return; {35612#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:38,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {35612#(<= ~counter~0 0)} call #t~ret7 := main(); {35612#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:38,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {35612#(<= ~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; {35612#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:38,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {35612#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {35628#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,057 INFO L272 TraceCheckUtils]: 8: Hoare triple {35628#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {35628#(<= ~counter~0 1)} ~cond := #in~cond; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {35628#(<= ~counter~0 1)} assume !(0 == ~cond); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {35628#(<= ~counter~0 1)} assume true; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,065 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35628#(<= ~counter~0 1)} {35628#(<= ~counter~0 1)} #78#return; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {35628#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {35628#(<= ~counter~0 1)} ~cond := #in~cond; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {35628#(<= ~counter~0 1)} assume !(0 == ~cond); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {35628#(<= ~counter~0 1)} assume true; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,066 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35628#(<= ~counter~0 1)} {35628#(<= ~counter~0 1)} #80#return; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,066 INFO L272 TraceCheckUtils]: 18: Hoare triple {35628#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {35628#(<= ~counter~0 1)} ~cond := #in~cond; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {35628#(<= ~counter~0 1)} assume !(0 == ~cond); {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {35628#(<= ~counter~0 1)} assume true; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,068 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35628#(<= ~counter~0 1)} {35628#(<= ~counter~0 1)} #82#return; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {35628#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35628#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:38,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {35628#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {35683#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,069 INFO L272 TraceCheckUtils]: 26: Hoare triple {35683#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {35683#(<= ~counter~0 2)} ~cond := #in~cond; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {35683#(<= ~counter~0 2)} assume !(0 == ~cond); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {35683#(<= ~counter~0 2)} assume true; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,070 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35683#(<= ~counter~0 2)} {35683#(<= ~counter~0 2)} #78#return; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,070 INFO L272 TraceCheckUtils]: 31: Hoare triple {35683#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {35683#(<= ~counter~0 2)} ~cond := #in~cond; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {35683#(<= ~counter~0 2)} assume !(0 == ~cond); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {35683#(<= ~counter~0 2)} assume true; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,071 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35683#(<= ~counter~0 2)} {35683#(<= ~counter~0 2)} #80#return; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,072 INFO L272 TraceCheckUtils]: 36: Hoare triple {35683#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {35683#(<= ~counter~0 2)} ~cond := #in~cond; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {35683#(<= ~counter~0 2)} assume !(0 == ~cond); {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {35683#(<= ~counter~0 2)} assume true; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,073 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35683#(<= ~counter~0 2)} {35683#(<= ~counter~0 2)} #82#return; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {35683#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35683#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:38,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {35683#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {35738#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,089 INFO L272 TraceCheckUtils]: 44: Hoare triple {35738#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {35738#(<= ~counter~0 3)} ~cond := #in~cond; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {35738#(<= ~counter~0 3)} assume !(0 == ~cond); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {35738#(<= ~counter~0 3)} assume true; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,090 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35738#(<= ~counter~0 3)} {35738#(<= ~counter~0 3)} #78#return; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,090 INFO L272 TraceCheckUtils]: 49: Hoare triple {35738#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {35738#(<= ~counter~0 3)} ~cond := #in~cond; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {35738#(<= ~counter~0 3)} assume !(0 == ~cond); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {35738#(<= ~counter~0 3)} assume true; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,091 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35738#(<= ~counter~0 3)} {35738#(<= ~counter~0 3)} #80#return; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,092 INFO L272 TraceCheckUtils]: 54: Hoare triple {35738#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {35738#(<= ~counter~0 3)} ~cond := #in~cond; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {35738#(<= ~counter~0 3)} assume !(0 == ~cond); {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {35738#(<= ~counter~0 3)} assume true; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,093 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35738#(<= ~counter~0 3)} {35738#(<= ~counter~0 3)} #82#return; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {35738#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35738#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:38,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {35738#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {35793#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,094 INFO L272 TraceCheckUtils]: 62: Hoare triple {35793#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {35793#(<= ~counter~0 4)} ~cond := #in~cond; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {35793#(<= ~counter~0 4)} assume !(0 == ~cond); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {35793#(<= ~counter~0 4)} assume true; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,096 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35793#(<= ~counter~0 4)} {35793#(<= ~counter~0 4)} #78#return; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,096 INFO L272 TraceCheckUtils]: 67: Hoare triple {35793#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {35793#(<= ~counter~0 4)} ~cond := #in~cond; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {35793#(<= ~counter~0 4)} assume !(0 == ~cond); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {35793#(<= ~counter~0 4)} assume true; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,097 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35793#(<= ~counter~0 4)} {35793#(<= ~counter~0 4)} #80#return; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,097 INFO L272 TraceCheckUtils]: 72: Hoare triple {35793#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {35793#(<= ~counter~0 4)} ~cond := #in~cond; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {35793#(<= ~counter~0 4)} assume !(0 == ~cond); {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {35793#(<= ~counter~0 4)} assume true; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,099 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35793#(<= ~counter~0 4)} {35793#(<= ~counter~0 4)} #82#return; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {35793#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35793#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:38,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {35793#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {35848#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,100 INFO L272 TraceCheckUtils]: 80: Hoare triple {35848#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {35848#(<= ~counter~0 5)} ~cond := #in~cond; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {35848#(<= ~counter~0 5)} assume !(0 == ~cond); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {35848#(<= ~counter~0 5)} assume true; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,101 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35848#(<= ~counter~0 5)} {35848#(<= ~counter~0 5)} #78#return; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,102 INFO L272 TraceCheckUtils]: 85: Hoare triple {35848#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {35848#(<= ~counter~0 5)} ~cond := #in~cond; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,102 INFO L290 TraceCheckUtils]: 87: Hoare triple {35848#(<= ~counter~0 5)} assume !(0 == ~cond); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,102 INFO L290 TraceCheckUtils]: 88: Hoare triple {35848#(<= ~counter~0 5)} assume true; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,103 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35848#(<= ~counter~0 5)} {35848#(<= ~counter~0 5)} #80#return; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,103 INFO L272 TraceCheckUtils]: 90: Hoare triple {35848#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,103 INFO L290 TraceCheckUtils]: 91: Hoare triple {35848#(<= ~counter~0 5)} ~cond := #in~cond; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,104 INFO L290 TraceCheckUtils]: 92: Hoare triple {35848#(<= ~counter~0 5)} assume !(0 == ~cond); {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,104 INFO L290 TraceCheckUtils]: 93: Hoare triple {35848#(<= ~counter~0 5)} assume true; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,104 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35848#(<= ~counter~0 5)} {35848#(<= ~counter~0 5)} #82#return; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {35848#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35848#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:38,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {35848#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {35903#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,106 INFO L272 TraceCheckUtils]: 98: Hoare triple {35903#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,106 INFO L290 TraceCheckUtils]: 99: Hoare triple {35903#(<= ~counter~0 6)} ~cond := #in~cond; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,106 INFO L290 TraceCheckUtils]: 100: Hoare triple {35903#(<= ~counter~0 6)} assume !(0 == ~cond); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {35903#(<= ~counter~0 6)} assume true; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,107 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35903#(<= ~counter~0 6)} {35903#(<= ~counter~0 6)} #78#return; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,107 INFO L272 TraceCheckUtils]: 103: Hoare triple {35903#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,108 INFO L290 TraceCheckUtils]: 104: Hoare triple {35903#(<= ~counter~0 6)} ~cond := #in~cond; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,108 INFO L290 TraceCheckUtils]: 105: Hoare triple {35903#(<= ~counter~0 6)} assume !(0 == ~cond); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,109 INFO L290 TraceCheckUtils]: 106: Hoare triple {35903#(<= ~counter~0 6)} assume true; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,109 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35903#(<= ~counter~0 6)} {35903#(<= ~counter~0 6)} #80#return; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,109 INFO L272 TraceCheckUtils]: 108: Hoare triple {35903#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,110 INFO L290 TraceCheckUtils]: 109: Hoare triple {35903#(<= ~counter~0 6)} ~cond := #in~cond; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {35903#(<= ~counter~0 6)} assume !(0 == ~cond); {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,110 INFO L290 TraceCheckUtils]: 111: Hoare triple {35903#(<= ~counter~0 6)} assume true; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,111 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35903#(<= ~counter~0 6)} {35903#(<= ~counter~0 6)} #82#return; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,111 INFO L290 TraceCheckUtils]: 113: Hoare triple {35903#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35903#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:38,111 INFO L290 TraceCheckUtils]: 114: Hoare triple {35903#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35958#(<= |main_#t~post5| 6)} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {35958#(<= |main_#t~post5| 6)} assume !(#t~post5 < 50);havoc #t~post5; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 116: Hoare triple {35605#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 117: Hoare triple {35605#false} assume !!(#t~post6 < 50);havoc #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L272 TraceCheckUtils]: 118: Hoare triple {35605#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 119: Hoare triple {35605#false} ~cond := #in~cond; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 120: Hoare triple {35605#false} assume !(0 == ~cond); {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 121: Hoare triple {35605#false} assume true; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35605#false} {35605#false} #84#return; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L272 TraceCheckUtils]: 123: Hoare triple {35605#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 124: Hoare triple {35605#false} ~cond := #in~cond; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 125: Hoare triple {35605#false} assume !(0 == ~cond); {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 126: Hoare triple {35605#false} assume true; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35605#false} {35605#false} #86#return; {35605#false} is VALID [2022-04-15 09:57:38,112 INFO L290 TraceCheckUtils]: 128: Hoare triple {35605#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); {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 129: Hoare triple {35605#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 130: Hoare triple {35605#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 131: Hoare triple {35605#false} assume !(#t~post6 < 50);havoc #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L272 TraceCheckUtils]: 132: Hoare triple {35605#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 133: Hoare triple {35605#false} ~cond := #in~cond; {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 134: Hoare triple {35605#false} assume 0 == ~cond; {35605#false} is VALID [2022-04-15 09:57:38,113 INFO L290 TraceCheckUtils]: 135: Hoare triple {35605#false} assume !false; {35605#false} is VALID [2022-04-15 09:57:38,114 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-15 09:57:38,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:38,592 INFO L290 TraceCheckUtils]: 135: Hoare triple {35605#false} assume !false; {35605#false} is VALID [2022-04-15 09:57:38,592 INFO L290 TraceCheckUtils]: 134: Hoare triple {35605#false} assume 0 == ~cond; {35605#false} is VALID [2022-04-15 09:57:38,592 INFO L290 TraceCheckUtils]: 133: Hoare triple {35605#false} ~cond := #in~cond; {35605#false} is VALID [2022-04-15 09:57:38,592 INFO L272 TraceCheckUtils]: 132: Hoare triple {35605#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35605#false} is VALID [2022-04-15 09:57:38,592 INFO L290 TraceCheckUtils]: 131: Hoare triple {35605#false} assume !(#t~post6 < 50);havoc #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,592 INFO L290 TraceCheckUtils]: 130: Hoare triple {35605#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 129: Hoare triple {35605#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 128: Hoare triple {35605#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); {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35604#true} {35605#false} #86#return; {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 126: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 125: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L272 TraceCheckUtils]: 123: Hoare triple {35605#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35604#true} {35605#false} #84#return; {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 119: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L272 TraceCheckUtils]: 118: Hoare triple {35605#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 117: Hoare triple {35605#false} assume !!(#t~post6 < 50);havoc #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,593 INFO L290 TraceCheckUtils]: 116: Hoare triple {35605#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35605#false} is VALID [2022-04-15 09:57:38,594 INFO L290 TraceCheckUtils]: 115: Hoare triple {36082#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {35605#false} is VALID [2022-04-15 09:57:38,594 INFO L290 TraceCheckUtils]: 114: Hoare triple {36086#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36082#(< |main_#t~post5| 50)} is VALID [2022-04-15 09:57:38,594 INFO L290 TraceCheckUtils]: 113: Hoare triple {36086#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,594 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35604#true} {36086#(< ~counter~0 50)} #82#return; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,594 INFO L290 TraceCheckUtils]: 111: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L290 TraceCheckUtils]: 110: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L290 TraceCheckUtils]: 109: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L272 TraceCheckUtils]: 108: Hoare triple {36086#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35604#true} {36086#(< ~counter~0 50)} #80#return; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,595 INFO L290 TraceCheckUtils]: 106: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L290 TraceCheckUtils]: 105: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L290 TraceCheckUtils]: 104: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L272 TraceCheckUtils]: 103: Hoare triple {36086#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,595 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35604#true} {36086#(< ~counter~0 50)} #78#return; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,596 INFO L290 TraceCheckUtils]: 101: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,596 INFO L272 TraceCheckUtils]: 98: Hoare triple {36086#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,596 INFO L290 TraceCheckUtils]: 97: Hoare triple {36086#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {36141#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36086#(< ~counter~0 50)} is VALID [2022-04-15 09:57:38,597 INFO L290 TraceCheckUtils]: 95: Hoare triple {36141#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,597 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35604#true} {36141#(< ~counter~0 49)} #82#return; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L290 TraceCheckUtils]: 91: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L272 TraceCheckUtils]: 90: Hoare triple {36141#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35604#true} {36141#(< ~counter~0 49)} #80#return; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,598 INFO L290 TraceCheckUtils]: 88: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L290 TraceCheckUtils]: 87: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L290 TraceCheckUtils]: 86: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L272 TraceCheckUtils]: 85: Hoare triple {36141#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,598 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35604#true} {36141#(< ~counter~0 49)} #78#return; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,599 INFO L272 TraceCheckUtils]: 80: Hoare triple {36141#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {36141#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {36196#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36141#(< ~counter~0 49)} is VALID [2022-04-15 09:57:38,600 INFO L290 TraceCheckUtils]: 77: Hoare triple {36196#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,600 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35604#true} {36196#(< ~counter~0 48)} #82#return; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,600 INFO L290 TraceCheckUtils]: 75: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,600 INFO L290 TraceCheckUtils]: 74: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,600 INFO L290 TraceCheckUtils]: 73: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,600 INFO L272 TraceCheckUtils]: 72: Hoare triple {36196#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35604#true} {36196#(< ~counter~0 48)} #80#return; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L272 TraceCheckUtils]: 67: Hoare triple {36196#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35604#true} {36196#(< ~counter~0 48)} #78#return; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 65: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,601 INFO L272 TraceCheckUtils]: 62: Hoare triple {36196#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {36196#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,602 INFO L290 TraceCheckUtils]: 60: Hoare triple {36251#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36196#(< ~counter~0 48)} is VALID [2022-04-15 09:57:38,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {36251#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,603 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35604#true} {36251#(< ~counter~0 47)} #82#return; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L272 TraceCheckUtils]: 54: Hoare triple {36251#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35604#true} {36251#(< ~counter~0 47)} #80#return; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,603 INFO L272 TraceCheckUtils]: 49: Hoare triple {36251#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,604 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35604#true} {36251#(< ~counter~0 47)} #78#return; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,604 INFO L272 TraceCheckUtils]: 44: Hoare triple {36251#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {36251#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {36306#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36251#(< ~counter~0 47)} is VALID [2022-04-15 09:57:38,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {36306#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,605 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35604#true} {36306#(< ~counter~0 46)} #82#return; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,607 INFO L272 TraceCheckUtils]: 36: Hoare triple {36306#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,607 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35604#true} {36306#(< ~counter~0 46)} #80#return; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,608 INFO L272 TraceCheckUtils]: 31: Hoare triple {36306#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,608 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35604#true} {36306#(< ~counter~0 46)} #78#return; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,627 INFO L272 TraceCheckUtils]: 26: Hoare triple {36306#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {36306#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {36361#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36306#(< ~counter~0 46)} is VALID [2022-04-15 09:57:38,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {36361#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,629 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35604#true} {36361#(< ~counter~0 45)} #82#return; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L272 TraceCheckUtils]: 18: Hoare triple {36361#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35604#true} {36361#(< ~counter~0 45)} #80#return; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {36361#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35604#true} {36361#(< ~counter~0 45)} #78#return; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {35604#true} assume true; {35604#true} is VALID [2022-04-15 09:57:38,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {35604#true} assume !(0 == ~cond); {35604#true} is VALID [2022-04-15 09:57:38,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {35604#true} ~cond := #in~cond; {35604#true} is VALID [2022-04-15 09:57:38,631 INFO L272 TraceCheckUtils]: 8: Hoare triple {36361#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35604#true} is VALID [2022-04-15 09:57:38,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {36361#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {36416#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36361#(< ~counter~0 45)} is VALID [2022-04-15 09:57:38,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {36416#(< ~counter~0 44)} 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; {36416#(< ~counter~0 44)} is VALID [2022-04-15 09:57:38,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {36416#(< ~counter~0 44)} call #t~ret7 := main(); {36416#(< ~counter~0 44)} is VALID [2022-04-15 09:57:38,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36416#(< ~counter~0 44)} {35604#true} #92#return; {36416#(< ~counter~0 44)} is VALID [2022-04-15 09:57:38,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {36416#(< ~counter~0 44)} assume true; {36416#(< ~counter~0 44)} is VALID [2022-04-15 09:57:38,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {35604#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; {36416#(< ~counter~0 44)} is VALID [2022-04-15 09:57:38,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {35604#true} call ULTIMATE.init(); {35604#true} is VALID [2022-04-15 09:57:38,633 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-15 09:57:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:38,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481476888] [2022-04-15 09:57:38,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832348357] [2022-04-15 09:57:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832348357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:38,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:38,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:57:38,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842295915] [2022-04-15 09:57:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842295915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:38,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:38,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:57:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529759744] [2022-04-15 09:57:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:38,635 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-15 09:57:38,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:38,635 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-15 09:57:38,688 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-15 09:57:38,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:57:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:38,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:57:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:57:38,689 INFO L87 Difference]: Start difference. First operand 399 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-15 09:57:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:39,613 INFO L93 Difference]: Finished difference Result 452 states and 501 transitions. [2022-04-15 09:57:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 09:57:39,614 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-15 09:57:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:39,614 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-15 09:57:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-15 09:57:39,625 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-15 09:57:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-15 09:57:39,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 158 transitions. [2022-04-15 09:57:39,744 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-15 09:57:39,751 INFO L225 Difference]: With dead ends: 452 [2022-04-15 09:57:39,752 INFO L226 Difference]: Without dead ends: 397 [2022-04-15 09:57:39,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:57:39,752 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:39,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:57:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-15 09:57:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-04-15 09:57:40,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:40,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:40,220 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:40,233 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:40,240 INFO L93 Difference]: Finished difference Result 397 states and 436 transitions. [2022-04-15 09:57:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-15 09:57:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:40,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:40,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 397 states. [2022-04-15 09:57:40,242 INFO L87 Difference]: Start difference. First operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 397 states. [2022-04-15 09:57:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:40,248 INFO L93 Difference]: Finished difference Result 397 states and 436 transitions. [2022-04-15 09:57:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-15 09:57:40,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:40,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:40,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:40,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 273 states have (on average 1.098901098901099) internal successors, (300), 278 states have internal predecessors, (300), 69 states have call successors, (69), 55 states have call predecessors, (69), 54 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-15 09:57:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 436 transitions. [2022-04-15 09:57:40,257 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 436 transitions. Word has length 136 [2022-04-15 09:57:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:40,257 INFO L478 AbstractCegarLoop]: Abstraction has 397 states and 436 transitions. [2022-04-15 09:57:40,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-15 09:57:40,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 397 states and 436 transitions. [2022-04-15 09:57:41,158 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-15 09:57:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 436 transitions. [2022-04-15 09:57:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 09:57:41,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:41,160 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:41,193 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-15 09:57:41,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 09:57:41,377 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 11 times [2022-04-15 09:57:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:41,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999674303] [2022-04-15 09:57:44,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:44,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:44,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 12 times [2022-04-15 09:57:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:44,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613106491] [2022-04-15 09:57:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:44,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:44,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621169268] [2022-04-15 09:57:44,911 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:57:44,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:44,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:44,925 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-15 09:57:44,970 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-15 09:57:45,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 09:57:45,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:45,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:57:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:45,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:45,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {38941#true} call ULTIMATE.init(); {38941#true} is VALID [2022-04-15 09:57:45,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {38941#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; {38949#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:45,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {38949#(<= ~counter~0 0)} assume true; {38949#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:45,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38949#(<= ~counter~0 0)} {38941#true} #92#return; {38949#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:45,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {38949#(<= ~counter~0 0)} call #t~ret7 := main(); {38949#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:45,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {38949#(<= ~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; {38949#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:45,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {38949#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {38965#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,727 INFO L272 TraceCheckUtils]: 8: Hoare triple {38965#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {38965#(<= ~counter~0 1)} ~cond := #in~cond; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {38965#(<= ~counter~0 1)} assume !(0 == ~cond); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {38965#(<= ~counter~0 1)} assume true; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,728 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38965#(<= ~counter~0 1)} {38965#(<= ~counter~0 1)} #78#return; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,729 INFO L272 TraceCheckUtils]: 13: Hoare triple {38965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {38965#(<= ~counter~0 1)} ~cond := #in~cond; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {38965#(<= ~counter~0 1)} assume !(0 == ~cond); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {38965#(<= ~counter~0 1)} assume true; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,730 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38965#(<= ~counter~0 1)} {38965#(<= ~counter~0 1)} #80#return; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {38965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {38965#(<= ~counter~0 1)} ~cond := #in~cond; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {38965#(<= ~counter~0 1)} assume !(0 == ~cond); {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {38965#(<= ~counter~0 1)} assume true; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,732 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38965#(<= ~counter~0 1)} {38965#(<= ~counter~0 1)} #82#return; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {38965#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38965#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:45,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {38965#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {39020#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,733 INFO L272 TraceCheckUtils]: 26: Hoare triple {39020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {39020#(<= ~counter~0 2)} ~cond := #in~cond; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {39020#(<= ~counter~0 2)} assume !(0 == ~cond); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {39020#(<= ~counter~0 2)} assume true; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,734 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {39020#(<= ~counter~0 2)} {39020#(<= ~counter~0 2)} #78#return; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,735 INFO L272 TraceCheckUtils]: 31: Hoare triple {39020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {39020#(<= ~counter~0 2)} ~cond := #in~cond; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {39020#(<= ~counter~0 2)} assume !(0 == ~cond); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {39020#(<= ~counter~0 2)} assume true; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,736 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {39020#(<= ~counter~0 2)} {39020#(<= ~counter~0 2)} #80#return; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,736 INFO L272 TraceCheckUtils]: 36: Hoare triple {39020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {39020#(<= ~counter~0 2)} ~cond := #in~cond; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {39020#(<= ~counter~0 2)} assume !(0 == ~cond); {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {39020#(<= ~counter~0 2)} assume true; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,738 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {39020#(<= ~counter~0 2)} {39020#(<= ~counter~0 2)} #82#return; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {39020#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39020#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:45,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {39020#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {39075#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,739 INFO L272 TraceCheckUtils]: 44: Hoare triple {39075#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {39075#(<= ~counter~0 3)} ~cond := #in~cond; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {39075#(<= ~counter~0 3)} assume !(0 == ~cond); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {39075#(<= ~counter~0 3)} assume true; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,740 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {39075#(<= ~counter~0 3)} {39075#(<= ~counter~0 3)} #78#return; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,741 INFO L272 TraceCheckUtils]: 49: Hoare triple {39075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {39075#(<= ~counter~0 3)} ~cond := #in~cond; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {39075#(<= ~counter~0 3)} assume !(0 == ~cond); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {39075#(<= ~counter~0 3)} assume true; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,742 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {39075#(<= ~counter~0 3)} {39075#(<= ~counter~0 3)} #80#return; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,742 INFO L272 TraceCheckUtils]: 54: Hoare triple {39075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {39075#(<= ~counter~0 3)} ~cond := #in~cond; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {39075#(<= ~counter~0 3)} assume !(0 == ~cond); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {39075#(<= ~counter~0 3)} assume true; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,744 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {39075#(<= ~counter~0 3)} {39075#(<= ~counter~0 3)} #82#return; {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {39075#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {39075#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:45,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {39075#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {39130#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {39130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {39130#(<= ~counter~0 4)} ~cond := #in~cond; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,746 INFO L290 TraceCheckUtils]: 64: Hoare triple {39130#(<= ~counter~0 4)} assume !(0 == ~cond); {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {39130#(<= ~counter~0 4)} assume true; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,747 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {39130#(<= ~counter~0 4)} {39130#(<= ~counter~0 4)} #84#return; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,747 INFO L272 TraceCheckUtils]: 67: Hoare triple {39130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {39130#(<= ~counter~0 4)} ~cond := #in~cond; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {39130#(<= ~counter~0 4)} assume !(0 == ~cond); {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {39130#(<= ~counter~0 4)} assume true; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,748 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39130#(<= ~counter~0 4)} {39130#(<= ~counter~0 4)} #86#return; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {39130#(<= ~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); {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {39130#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39130#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:45,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {39130#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {39173#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,750 INFO L272 TraceCheckUtils]: 76: Hoare triple {39173#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {39173#(<= ~counter~0 5)} ~cond := #in~cond; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {39173#(<= ~counter~0 5)} assume !(0 == ~cond); {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {39173#(<= ~counter~0 5)} assume true; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,751 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {39173#(<= ~counter~0 5)} {39173#(<= ~counter~0 5)} #84#return; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,752 INFO L272 TraceCheckUtils]: 81: Hoare triple {39173#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {39173#(<= ~counter~0 5)} ~cond := #in~cond; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {39173#(<= ~counter~0 5)} assume !(0 == ~cond); {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,753 INFO L290 TraceCheckUtils]: 84: Hoare triple {39173#(<= ~counter~0 5)} assume true; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,753 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {39173#(<= ~counter~0 5)} {39173#(<= ~counter~0 5)} #86#return; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {39173#(<= ~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); {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,754 INFO L290 TraceCheckUtils]: 87: Hoare triple {39173#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39173#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:45,754 INFO L290 TraceCheckUtils]: 88: Hoare triple {39173#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {39216#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,755 INFO L272 TraceCheckUtils]: 90: Hoare triple {39216#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {39216#(<= ~counter~0 6)} ~cond := #in~cond; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {39216#(<= ~counter~0 6)} assume !(0 == ~cond); {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,756 INFO L290 TraceCheckUtils]: 93: Hoare triple {39216#(<= ~counter~0 6)} assume true; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,756 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {39216#(<= ~counter~0 6)} {39216#(<= ~counter~0 6)} #84#return; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,757 INFO L272 TraceCheckUtils]: 95: Hoare triple {39216#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,757 INFO L290 TraceCheckUtils]: 96: Hoare triple {39216#(<= ~counter~0 6)} ~cond := #in~cond; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,757 INFO L290 TraceCheckUtils]: 97: Hoare triple {39216#(<= ~counter~0 6)} assume !(0 == ~cond); {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,757 INFO L290 TraceCheckUtils]: 98: Hoare triple {39216#(<= ~counter~0 6)} assume true; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,758 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {39216#(<= ~counter~0 6)} {39216#(<= ~counter~0 6)} #86#return; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,758 INFO L290 TraceCheckUtils]: 100: Hoare triple {39216#(<= ~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); {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {39216#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39216#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:45,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {39216#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {39259#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,760 INFO L272 TraceCheckUtils]: 104: Hoare triple {39259#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {39259#(<= ~counter~0 7)} ~cond := #in~cond; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {39259#(<= ~counter~0 7)} assume !(0 == ~cond); {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {39259#(<= ~counter~0 7)} assume true; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,761 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {39259#(<= ~counter~0 7)} {39259#(<= ~counter~0 7)} #84#return; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,762 INFO L272 TraceCheckUtils]: 109: Hoare triple {39259#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,762 INFO L290 TraceCheckUtils]: 110: Hoare triple {39259#(<= ~counter~0 7)} ~cond := #in~cond; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,762 INFO L290 TraceCheckUtils]: 111: Hoare triple {39259#(<= ~counter~0 7)} assume !(0 == ~cond); {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,762 INFO L290 TraceCheckUtils]: 112: Hoare triple {39259#(<= ~counter~0 7)} assume true; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,763 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {39259#(<= ~counter~0 7)} {39259#(<= ~counter~0 7)} #86#return; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,763 INFO L290 TraceCheckUtils]: 114: Hoare triple {39259#(<= ~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); {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,763 INFO L290 TraceCheckUtils]: 115: Hoare triple {39259#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39259#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:45,764 INFO L290 TraceCheckUtils]: 116: Hoare triple {39259#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,764 INFO L290 TraceCheckUtils]: 117: Hoare triple {39302#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,765 INFO L272 TraceCheckUtils]: 118: Hoare triple {39302#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,765 INFO L290 TraceCheckUtils]: 119: Hoare triple {39302#(<= ~counter~0 8)} ~cond := #in~cond; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,765 INFO L290 TraceCheckUtils]: 120: Hoare triple {39302#(<= ~counter~0 8)} assume !(0 == ~cond); {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,765 INFO L290 TraceCheckUtils]: 121: Hoare triple {39302#(<= ~counter~0 8)} assume true; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,766 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {39302#(<= ~counter~0 8)} {39302#(<= ~counter~0 8)} #84#return; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,766 INFO L272 TraceCheckUtils]: 123: Hoare triple {39302#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,767 INFO L290 TraceCheckUtils]: 124: Hoare triple {39302#(<= ~counter~0 8)} ~cond := #in~cond; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,767 INFO L290 TraceCheckUtils]: 125: Hoare triple {39302#(<= ~counter~0 8)} assume !(0 == ~cond); {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,767 INFO L290 TraceCheckUtils]: 126: Hoare triple {39302#(<= ~counter~0 8)} assume true; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,768 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {39302#(<= ~counter~0 8)} {39302#(<= ~counter~0 8)} #86#return; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,768 INFO L290 TraceCheckUtils]: 128: Hoare triple {39302#(<= ~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); {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,768 INFO L290 TraceCheckUtils]: 129: Hoare triple {39302#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39302#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:45,768 INFO L290 TraceCheckUtils]: 130: Hoare triple {39302#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39345#(<= |main_#t~post6| 8)} is VALID [2022-04-15 09:57:45,769 INFO L290 TraceCheckUtils]: 131: Hoare triple {39345#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {38942#false} is VALID [2022-04-15 09:57:45,769 INFO L272 TraceCheckUtils]: 132: Hoare triple {38942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38942#false} is VALID [2022-04-15 09:57:45,769 INFO L290 TraceCheckUtils]: 133: Hoare triple {38942#false} ~cond := #in~cond; {38942#false} is VALID [2022-04-15 09:57:45,769 INFO L290 TraceCheckUtils]: 134: Hoare triple {38942#false} assume 0 == ~cond; {38942#false} is VALID [2022-04-15 09:57:45,769 INFO L290 TraceCheckUtils]: 135: Hoare triple {38942#false} assume !false; {38942#false} is VALID [2022-04-15 09:57:45,770 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-15 09:57:45,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:46,336 INFO L290 TraceCheckUtils]: 135: Hoare triple {38942#false} assume !false; {38942#false} is VALID [2022-04-15 09:57:46,336 INFO L290 TraceCheckUtils]: 134: Hoare triple {38942#false} assume 0 == ~cond; {38942#false} is VALID [2022-04-15 09:57:46,336 INFO L290 TraceCheckUtils]: 133: Hoare triple {38942#false} ~cond := #in~cond; {38942#false} is VALID [2022-04-15 09:57:46,336 INFO L272 TraceCheckUtils]: 132: Hoare triple {38942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38942#false} is VALID [2022-04-15 09:57:46,337 INFO L290 TraceCheckUtils]: 131: Hoare triple {39373#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {38942#false} is VALID [2022-04-15 09:57:46,337 INFO L290 TraceCheckUtils]: 130: Hoare triple {39377#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39373#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:57:46,338 INFO L290 TraceCheckUtils]: 129: Hoare triple {39377#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,338 INFO L290 TraceCheckUtils]: 128: Hoare triple {39377#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,338 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38941#true} {39377#(< ~counter~0 50)} #86#return; {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,338 INFO L290 TraceCheckUtils]: 126: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,338 INFO L290 TraceCheckUtils]: 125: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,338 INFO L290 TraceCheckUtils]: 124: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,338 INFO L272 TraceCheckUtils]: 123: Hoare triple {39377#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,339 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38941#true} {39377#(< ~counter~0 50)} #84#return; {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,339 INFO L290 TraceCheckUtils]: 120: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,339 INFO L290 TraceCheckUtils]: 119: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,339 INFO L272 TraceCheckUtils]: 118: Hoare triple {39377#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,339 INFO L290 TraceCheckUtils]: 117: Hoare triple {39377#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,340 INFO L290 TraceCheckUtils]: 116: Hoare triple {39420#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39377#(< ~counter~0 50)} is VALID [2022-04-15 09:57:46,340 INFO L290 TraceCheckUtils]: 115: Hoare triple {39420#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,341 INFO L290 TraceCheckUtils]: 114: Hoare triple {39420#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,341 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38941#true} {39420#(< ~counter~0 49)} #86#return; {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,341 INFO L290 TraceCheckUtils]: 112: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,341 INFO L290 TraceCheckUtils]: 111: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,341 INFO L272 TraceCheckUtils]: 109: Hoare triple {39420#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,341 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38941#true} {39420#(< ~counter~0 49)} #84#return; {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,341 INFO L290 TraceCheckUtils]: 107: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,342 INFO L290 TraceCheckUtils]: 106: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,342 INFO L290 TraceCheckUtils]: 105: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,342 INFO L272 TraceCheckUtils]: 104: Hoare triple {39420#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {39420#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {39463#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39420#(< ~counter~0 49)} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {39463#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 100: Hoare triple {39463#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,343 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38941#true} {39463#(< ~counter~0 48)} #86#return; {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 97: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,343 INFO L290 TraceCheckUtils]: 96: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,343 INFO L272 TraceCheckUtils]: 95: Hoare triple {39463#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,344 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38941#true} {39463#(< ~counter~0 48)} #84#return; {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,344 INFO L290 TraceCheckUtils]: 93: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,344 INFO L290 TraceCheckUtils]: 92: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,344 INFO L290 TraceCheckUtils]: 91: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,344 INFO L272 TraceCheckUtils]: 90: Hoare triple {39463#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,344 INFO L290 TraceCheckUtils]: 89: Hoare triple {39463#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {39506#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39463#(< ~counter~0 48)} is VALID [2022-04-15 09:57:46,345 INFO L290 TraceCheckUtils]: 87: Hoare triple {39506#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,345 INFO L290 TraceCheckUtils]: 86: Hoare triple {39506#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,345 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38941#true} {39506#(< ~counter~0 47)} #86#return; {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,345 INFO L290 TraceCheckUtils]: 83: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L290 TraceCheckUtils]: 82: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L272 TraceCheckUtils]: 81: Hoare triple {39506#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38941#true} {39506#(< ~counter~0 47)} #84#return; {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L290 TraceCheckUtils]: 77: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L272 TraceCheckUtils]: 76: Hoare triple {39506#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {39506#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {39549#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39506#(< ~counter~0 47)} is VALID [2022-04-15 09:57:46,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {39549#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {39549#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,348 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38941#true} {39549#(< ~counter~0 46)} #86#return; {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 70: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 69: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 68: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L272 TraceCheckUtils]: 67: Hoare triple {39549#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38941#true} {39549#(< ~counter~0 46)} #84#return; {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 65: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,348 INFO L272 TraceCheckUtils]: 62: Hoare triple {39549#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {39549#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {39592#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39549#(< ~counter~0 46)} is VALID [2022-04-15 09:57:46,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {39592#(< ~counter~0 45)} assume !(~r~0 >= ~d~0); {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,350 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38941#true} {39592#(< ~counter~0 45)} #82#return; {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L272 TraceCheckUtils]: 54: Hoare triple {39592#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38941#true} {39592#(< ~counter~0 45)} #80#return; {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,350 INFO L272 TraceCheckUtils]: 49: Hoare triple {39592#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,351 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38941#true} {39592#(< ~counter~0 45)} #78#return; {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,351 INFO L272 TraceCheckUtils]: 44: Hoare triple {39592#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,351 INFO L290 TraceCheckUtils]: 43: Hoare triple {39592#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {39647#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39592#(< ~counter~0 45)} is VALID [2022-04-15 09:57:46,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {39647#(< ~counter~0 44)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,352 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38941#true} {39647#(< ~counter~0 44)} #82#return; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L272 TraceCheckUtils]: 36: Hoare triple {39647#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38941#true} {39647#(< ~counter~0 44)} #80#return; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L272 TraceCheckUtils]: 31: Hoare triple {39647#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38941#true} {39647#(< ~counter~0 44)} #78#return; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,354 INFO L272 TraceCheckUtils]: 26: Hoare triple {39647#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {39647#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {39702#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39647#(< ~counter~0 44)} is VALID [2022-04-15 09:57:46,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {39702#(< ~counter~0 43)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,355 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38941#true} {39702#(< ~counter~0 43)} #82#return; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,355 INFO L272 TraceCheckUtils]: 18: Hoare triple {39702#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38941#true} {39702#(< ~counter~0 43)} #80#return; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L272 TraceCheckUtils]: 13: Hoare triple {39702#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38941#true} {39702#(< ~counter~0 43)} #78#return; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {38941#true} assume true; {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {38941#true} assume !(0 == ~cond); {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {38941#true} ~cond := #in~cond; {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L272 TraceCheckUtils]: 8: Hoare triple {39702#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38941#true} is VALID [2022-04-15 09:57:46,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {39702#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {39757#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39702#(< ~counter~0 43)} is VALID [2022-04-15 09:57:46,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {39757#(< ~counter~0 42)} 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; {39757#(< ~counter~0 42)} is VALID [2022-04-15 09:57:46,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {39757#(< ~counter~0 42)} call #t~ret7 := main(); {39757#(< ~counter~0 42)} is VALID [2022-04-15 09:57:46,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39757#(< ~counter~0 42)} {38941#true} #92#return; {39757#(< ~counter~0 42)} is VALID [2022-04-15 09:57:46,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {39757#(< ~counter~0 42)} assume true; {39757#(< ~counter~0 42)} is VALID [2022-04-15 09:57:46,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {38941#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; {39757#(< ~counter~0 42)} is VALID [2022-04-15 09:57:46,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {38941#true} call ULTIMATE.init(); {38941#true} is VALID [2022-04-15 09:57:46,358 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-15 09:57:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:46,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613106491] [2022-04-15 09:57:46,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:46,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621169268] [2022-04-15 09:57:46,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621169268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:46,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:46,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 09:57:46,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:46,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999674303] [2022-04-15 09:57:46,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999674303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:46,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:46,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 09:57:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232093667] [2022-04-15 09:57:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:46,360 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-15 09:57:46,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:46,360 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-15 09:57:46,422 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-15 09:57:46,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 09:57:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 09:57:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:57:46,426 INFO L87 Difference]: Start difference. First operand 397 states and 436 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-15 09:57:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:47,742 INFO L93 Difference]: Finished difference Result 493 states and 550 transitions. [2022-04-15 09:57:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 09:57:47,743 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-15 09:57:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:47,743 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-15 09:57:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-15 09:57:47,744 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-15 09:57:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-15 09:57:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 193 transitions. [2022-04-15 09:57:47,904 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-15 09:57:47,914 INFO L225 Difference]: With dead ends: 493 [2022-04-15 09:57:47,914 INFO L226 Difference]: Without dead ends: 480 [2022-04-15 09:57:47,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2022-04-15 09:57:47,918 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:47,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:57:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-04-15 09:57:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2022-04-15 09:57:48,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:48,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 09:57:48,561 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 09:57:48,561 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 09:57:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:48,569 INFO L93 Difference]: Finished difference Result 480 states and 530 transitions. [2022-04-15 09:57:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 530 transitions. [2022-04-15 09:57:48,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:48,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:48,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 480 states. [2022-04-15 09:57:48,571 INFO L87 Difference]: Start difference. First operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 480 states. [2022-04-15 09:57:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:48,579 INFO L93 Difference]: Finished difference Result 480 states and 530 transitions. [2022-04-15 09:57:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 530 transitions. [2022-04-15 09:57:48,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:48,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:48,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:48,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 330 states have (on average 1.1) internal successors, (363), 336 states have internal predecessors, (363), 84 states have call successors, (84), 65 states have call predecessors, (84), 64 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-15 09:57:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 529 transitions. [2022-04-15 09:57:48,596 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 529 transitions. Word has length 136 [2022-04-15 09:57:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:48,596 INFO L478 AbstractCegarLoop]: Abstraction has 479 states and 529 transitions. [2022-04-15 09:57:48,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-15 09:57:48,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 479 states and 529 transitions. [2022-04-15 09:57:49,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:57:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 529 transitions. [2022-04-15 09:57:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 09:57:49,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:49,667 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:49,683 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-15 09:57:49,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 09:57:49,867 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 13 times [2022-04-15 09:57:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235227668] [2022-04-15 09:57:53,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:57:53,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:57:53,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:57:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 14 times [2022-04-15 09:57:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:57:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000674967] [2022-04-15 09:57:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:57:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:57:53,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:57:53,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258113104] [2022-04-15 09:57:53,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:57:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:57:53,978 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-15 09:57:53,979 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-15 09:57:54,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:57:54,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:57:54,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 09:57:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:57:54,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:57:54,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {42692#true} call ULTIMATE.init(); {42692#true} is VALID [2022-04-15 09:57:54,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {42692#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; {42700#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:54,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {42700#(<= ~counter~0 0)} assume true; {42700#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:54,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42700#(<= ~counter~0 0)} {42692#true} #92#return; {42700#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:54,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {42700#(<= ~counter~0 0)} call #t~ret7 := main(); {42700#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:54,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {42700#(<= ~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; {42700#(<= ~counter~0 0)} is VALID [2022-04-15 09:57:54,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {42700#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {42716#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,811 INFO L272 TraceCheckUtils]: 8: Hoare triple {42716#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {42716#(<= ~counter~0 1)} ~cond := #in~cond; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {42716#(<= ~counter~0 1)} assume !(0 == ~cond); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {42716#(<= ~counter~0 1)} assume true; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,812 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42716#(<= ~counter~0 1)} {42716#(<= ~counter~0 1)} #78#return; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,812 INFO L272 TraceCheckUtils]: 13: Hoare triple {42716#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {42716#(<= ~counter~0 1)} ~cond := #in~cond; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {42716#(<= ~counter~0 1)} assume !(0 == ~cond); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {42716#(<= ~counter~0 1)} assume true; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42716#(<= ~counter~0 1)} {42716#(<= ~counter~0 1)} #80#return; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {42716#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {42716#(<= ~counter~0 1)} ~cond := #in~cond; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {42716#(<= ~counter~0 1)} assume !(0 == ~cond); {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {42716#(<= ~counter~0 1)} assume true; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42716#(<= ~counter~0 1)} {42716#(<= ~counter~0 1)} #82#return; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {42716#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42716#(<= ~counter~0 1)} is VALID [2022-04-15 09:57:54,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {42716#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {42771#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,817 INFO L272 TraceCheckUtils]: 26: Hoare triple {42771#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {42771#(<= ~counter~0 2)} ~cond := #in~cond; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {42771#(<= ~counter~0 2)} assume !(0 == ~cond); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {42771#(<= ~counter~0 2)} assume true; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,818 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42771#(<= ~counter~0 2)} {42771#(<= ~counter~0 2)} #78#return; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,818 INFO L272 TraceCheckUtils]: 31: Hoare triple {42771#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {42771#(<= ~counter~0 2)} ~cond := #in~cond; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {42771#(<= ~counter~0 2)} assume !(0 == ~cond); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {42771#(<= ~counter~0 2)} assume true; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,819 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42771#(<= ~counter~0 2)} {42771#(<= ~counter~0 2)} #80#return; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,820 INFO L272 TraceCheckUtils]: 36: Hoare triple {42771#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {42771#(<= ~counter~0 2)} ~cond := #in~cond; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,820 INFO L290 TraceCheckUtils]: 38: Hoare triple {42771#(<= ~counter~0 2)} assume !(0 == ~cond); {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {42771#(<= ~counter~0 2)} assume true; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,821 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42771#(<= ~counter~0 2)} {42771#(<= ~counter~0 2)} #82#return; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {42771#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42771#(<= ~counter~0 2)} is VALID [2022-04-15 09:57:54,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {42771#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {42826#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,823 INFO L272 TraceCheckUtils]: 44: Hoare triple {42826#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {42826#(<= ~counter~0 3)} ~cond := #in~cond; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {42826#(<= ~counter~0 3)} assume !(0 == ~cond); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {42826#(<= ~counter~0 3)} assume true; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,824 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42826#(<= ~counter~0 3)} {42826#(<= ~counter~0 3)} #78#return; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,824 INFO L272 TraceCheckUtils]: 49: Hoare triple {42826#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {42826#(<= ~counter~0 3)} ~cond := #in~cond; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {42826#(<= ~counter~0 3)} assume !(0 == ~cond); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {42826#(<= ~counter~0 3)} assume true; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,825 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42826#(<= ~counter~0 3)} {42826#(<= ~counter~0 3)} #80#return; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,826 INFO L272 TraceCheckUtils]: 54: Hoare triple {42826#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {42826#(<= ~counter~0 3)} ~cond := #in~cond; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {42826#(<= ~counter~0 3)} assume !(0 == ~cond); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,826 INFO L290 TraceCheckUtils]: 57: Hoare triple {42826#(<= ~counter~0 3)} assume true; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,827 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42826#(<= ~counter~0 3)} {42826#(<= ~counter~0 3)} #82#return; {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {42826#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {42826#(<= ~counter~0 3)} is VALID [2022-04-15 09:57:54,828 INFO L290 TraceCheckUtils]: 60: Hoare triple {42826#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,828 INFO L290 TraceCheckUtils]: 61: Hoare triple {42881#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,829 INFO L272 TraceCheckUtils]: 62: Hoare triple {42881#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {42881#(<= ~counter~0 4)} ~cond := #in~cond; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {42881#(<= ~counter~0 4)} assume !(0 == ~cond); {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {42881#(<= ~counter~0 4)} assume true; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,830 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42881#(<= ~counter~0 4)} {42881#(<= ~counter~0 4)} #84#return; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,830 INFO L272 TraceCheckUtils]: 67: Hoare triple {42881#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {42881#(<= ~counter~0 4)} ~cond := #in~cond; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {42881#(<= ~counter~0 4)} assume !(0 == ~cond); {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {42881#(<= ~counter~0 4)} assume true; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,832 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42881#(<= ~counter~0 4)} {42881#(<= ~counter~0 4)} #86#return; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {42881#(<= ~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); {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {42881#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42881#(<= ~counter~0 4)} is VALID [2022-04-15 09:57:54,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {42881#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,833 INFO L290 TraceCheckUtils]: 75: Hoare triple {42924#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,834 INFO L272 TraceCheckUtils]: 76: Hoare triple {42924#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,834 INFO L290 TraceCheckUtils]: 77: Hoare triple {42924#(<= ~counter~0 5)} ~cond := #in~cond; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,834 INFO L290 TraceCheckUtils]: 78: Hoare triple {42924#(<= ~counter~0 5)} assume !(0 == ~cond); {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {42924#(<= ~counter~0 5)} assume true; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,835 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42924#(<= ~counter~0 5)} {42924#(<= ~counter~0 5)} #84#return; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,835 INFO L272 TraceCheckUtils]: 81: Hoare triple {42924#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,835 INFO L290 TraceCheckUtils]: 82: Hoare triple {42924#(<= ~counter~0 5)} ~cond := #in~cond; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,836 INFO L290 TraceCheckUtils]: 83: Hoare triple {42924#(<= ~counter~0 5)} assume !(0 == ~cond); {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,836 INFO L290 TraceCheckUtils]: 84: Hoare triple {42924#(<= ~counter~0 5)} assume true; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,836 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42924#(<= ~counter~0 5)} {42924#(<= ~counter~0 5)} #86#return; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {42924#(<= ~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); {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,837 INFO L290 TraceCheckUtils]: 87: Hoare triple {42924#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42924#(<= ~counter~0 5)} is VALID [2022-04-15 09:57:54,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {42924#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {42967#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,838 INFO L272 TraceCheckUtils]: 90: Hoare triple {42967#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,839 INFO L290 TraceCheckUtils]: 91: Hoare triple {42967#(<= ~counter~0 6)} ~cond := #in~cond; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,839 INFO L290 TraceCheckUtils]: 92: Hoare triple {42967#(<= ~counter~0 6)} assume !(0 == ~cond); {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,839 INFO L290 TraceCheckUtils]: 93: Hoare triple {42967#(<= ~counter~0 6)} assume true; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,840 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42967#(<= ~counter~0 6)} {42967#(<= ~counter~0 6)} #84#return; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,840 INFO L272 TraceCheckUtils]: 95: Hoare triple {42967#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,840 INFO L290 TraceCheckUtils]: 96: Hoare triple {42967#(<= ~counter~0 6)} ~cond := #in~cond; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,841 INFO L290 TraceCheckUtils]: 97: Hoare triple {42967#(<= ~counter~0 6)} assume !(0 == ~cond); {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,841 INFO L290 TraceCheckUtils]: 98: Hoare triple {42967#(<= ~counter~0 6)} assume true; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,841 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42967#(<= ~counter~0 6)} {42967#(<= ~counter~0 6)} #86#return; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,841 INFO L290 TraceCheckUtils]: 100: Hoare triple {42967#(<= ~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); {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,842 INFO L290 TraceCheckUtils]: 101: Hoare triple {42967#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42967#(<= ~counter~0 6)} is VALID [2022-04-15 09:57:54,842 INFO L290 TraceCheckUtils]: 102: Hoare triple {42967#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {43010#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,843 INFO L272 TraceCheckUtils]: 104: Hoare triple {43010#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,843 INFO L290 TraceCheckUtils]: 105: Hoare triple {43010#(<= ~counter~0 7)} ~cond := #in~cond; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {43010#(<= ~counter~0 7)} assume !(0 == ~cond); {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,844 INFO L290 TraceCheckUtils]: 107: Hoare triple {43010#(<= ~counter~0 7)} assume true; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,844 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {43010#(<= ~counter~0 7)} {43010#(<= ~counter~0 7)} #84#return; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,845 INFO L272 TraceCheckUtils]: 109: Hoare triple {43010#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,845 INFO L290 TraceCheckUtils]: 110: Hoare triple {43010#(<= ~counter~0 7)} ~cond := #in~cond; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,845 INFO L290 TraceCheckUtils]: 111: Hoare triple {43010#(<= ~counter~0 7)} assume !(0 == ~cond); {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,846 INFO L290 TraceCheckUtils]: 112: Hoare triple {43010#(<= ~counter~0 7)} assume true; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,846 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {43010#(<= ~counter~0 7)} {43010#(<= ~counter~0 7)} #86#return; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,846 INFO L290 TraceCheckUtils]: 114: Hoare triple {43010#(<= ~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); {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,847 INFO L290 TraceCheckUtils]: 115: Hoare triple {43010#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43010#(<= ~counter~0 7)} is VALID [2022-04-15 09:57:54,847 INFO L290 TraceCheckUtils]: 116: Hoare triple {43010#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,848 INFO L290 TraceCheckUtils]: 117: Hoare triple {43053#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,848 INFO L272 TraceCheckUtils]: 118: Hoare triple {43053#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,848 INFO L290 TraceCheckUtils]: 119: Hoare triple {43053#(<= ~counter~0 8)} ~cond := #in~cond; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,849 INFO L290 TraceCheckUtils]: 120: Hoare triple {43053#(<= ~counter~0 8)} assume !(0 == ~cond); {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,849 INFO L290 TraceCheckUtils]: 121: Hoare triple {43053#(<= ~counter~0 8)} assume true; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,849 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {43053#(<= ~counter~0 8)} {43053#(<= ~counter~0 8)} #84#return; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,850 INFO L272 TraceCheckUtils]: 123: Hoare triple {43053#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,850 INFO L290 TraceCheckUtils]: 124: Hoare triple {43053#(<= ~counter~0 8)} ~cond := #in~cond; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,850 INFO L290 TraceCheckUtils]: 125: Hoare triple {43053#(<= ~counter~0 8)} assume !(0 == ~cond); {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,850 INFO L290 TraceCheckUtils]: 126: Hoare triple {43053#(<= ~counter~0 8)} assume true; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,851 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {43053#(<= ~counter~0 8)} {43053#(<= ~counter~0 8)} #86#return; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {43053#(<= ~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); {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {43053#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43053#(<= ~counter~0 8)} is VALID [2022-04-15 09:57:54,852 INFO L290 TraceCheckUtils]: 130: Hoare triple {43053#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,852 INFO L290 TraceCheckUtils]: 131: Hoare triple {43096#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,853 INFO L272 TraceCheckUtils]: 132: Hoare triple {43096#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,853 INFO L290 TraceCheckUtils]: 133: Hoare triple {43096#(<= ~counter~0 9)} ~cond := #in~cond; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,853 INFO L290 TraceCheckUtils]: 134: Hoare triple {43096#(<= ~counter~0 9)} assume !(0 == ~cond); {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,854 INFO L290 TraceCheckUtils]: 135: Hoare triple {43096#(<= ~counter~0 9)} assume true; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,854 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {43096#(<= ~counter~0 9)} {43096#(<= ~counter~0 9)} #84#return; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,855 INFO L272 TraceCheckUtils]: 137: Hoare triple {43096#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,855 INFO L290 TraceCheckUtils]: 138: Hoare triple {43096#(<= ~counter~0 9)} ~cond := #in~cond; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,855 INFO L290 TraceCheckUtils]: 139: Hoare triple {43096#(<= ~counter~0 9)} assume !(0 == ~cond); {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,855 INFO L290 TraceCheckUtils]: 140: Hoare triple {43096#(<= ~counter~0 9)} assume true; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,856 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {43096#(<= ~counter~0 9)} {43096#(<= ~counter~0 9)} #86#return; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,856 INFO L290 TraceCheckUtils]: 142: Hoare triple {43096#(<= ~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); {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,856 INFO L290 TraceCheckUtils]: 143: Hoare triple {43096#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43096#(<= ~counter~0 9)} is VALID [2022-04-15 09:57:54,857 INFO L290 TraceCheckUtils]: 144: Hoare triple {43096#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43139#(<= |main_#t~post6| 9)} is VALID [2022-04-15 09:57:54,857 INFO L290 TraceCheckUtils]: 145: Hoare triple {43139#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {42693#false} is VALID [2022-04-15 09:57:54,857 INFO L272 TraceCheckUtils]: 146: Hoare triple {42693#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42693#false} is VALID [2022-04-15 09:57:54,857 INFO L290 TraceCheckUtils]: 147: Hoare triple {42693#false} ~cond := #in~cond; {42693#false} is VALID [2022-04-15 09:57:54,857 INFO L290 TraceCheckUtils]: 148: Hoare triple {42693#false} assume 0 == ~cond; {42693#false} is VALID [2022-04-15 09:57:54,857 INFO L290 TraceCheckUtils]: 149: Hoare triple {42693#false} assume !false; {42693#false} is VALID [2022-04-15 09:57:54,858 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-15 09:57:54,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:57:55,626 INFO L290 TraceCheckUtils]: 149: Hoare triple {42693#false} assume !false; {42693#false} is VALID [2022-04-15 09:57:55,626 INFO L290 TraceCheckUtils]: 148: Hoare triple {42693#false} assume 0 == ~cond; {42693#false} is VALID [2022-04-15 09:57:55,627 INFO L290 TraceCheckUtils]: 147: Hoare triple {42693#false} ~cond := #in~cond; {42693#false} is VALID [2022-04-15 09:57:55,627 INFO L272 TraceCheckUtils]: 146: Hoare triple {42693#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42693#false} is VALID [2022-04-15 09:57:55,627 INFO L290 TraceCheckUtils]: 145: Hoare triple {43167#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {42693#false} is VALID [2022-04-15 09:57:55,627 INFO L290 TraceCheckUtils]: 144: Hoare triple {43171#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43167#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:57:55,627 INFO L290 TraceCheckUtils]: 143: Hoare triple {43171#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,628 INFO L290 TraceCheckUtils]: 142: Hoare triple {43171#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,628 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42692#true} {43171#(< ~counter~0 50)} #86#return; {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,628 INFO L290 TraceCheckUtils]: 140: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,628 INFO L290 TraceCheckUtils]: 139: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,628 INFO L272 TraceCheckUtils]: 137: Hoare triple {43171#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,629 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42692#true} {43171#(< ~counter~0 50)} #84#return; {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,629 INFO L290 TraceCheckUtils]: 135: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,629 INFO L290 TraceCheckUtils]: 134: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,629 INFO L290 TraceCheckUtils]: 133: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,629 INFO L272 TraceCheckUtils]: 132: Hoare triple {43171#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,629 INFO L290 TraceCheckUtils]: 131: Hoare triple {43171#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,630 INFO L290 TraceCheckUtils]: 130: Hoare triple {43214#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43171#(< ~counter~0 50)} is VALID [2022-04-15 09:57:55,631 INFO L290 TraceCheckUtils]: 129: Hoare triple {43214#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,631 INFO L290 TraceCheckUtils]: 128: Hoare triple {43214#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,631 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42692#true} {43214#(< ~counter~0 49)} #86#return; {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,631 INFO L290 TraceCheckUtils]: 126: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,631 INFO L290 TraceCheckUtils]: 125: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L290 TraceCheckUtils]: 124: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L272 TraceCheckUtils]: 123: Hoare triple {43214#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42692#true} {43214#(< ~counter~0 49)} #84#return; {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L290 TraceCheckUtils]: 120: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L290 TraceCheckUtils]: 119: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,632 INFO L272 TraceCheckUtils]: 118: Hoare triple {43214#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,633 INFO L290 TraceCheckUtils]: 117: Hoare triple {43214#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,633 INFO L290 TraceCheckUtils]: 116: Hoare triple {43257#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43214#(< ~counter~0 49)} is VALID [2022-04-15 09:57:55,634 INFO L290 TraceCheckUtils]: 115: Hoare triple {43257#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,634 INFO L290 TraceCheckUtils]: 114: Hoare triple {43257#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,634 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42692#true} {43257#(< ~counter~0 48)} #86#return; {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,634 INFO L290 TraceCheckUtils]: 112: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,634 INFO L290 TraceCheckUtils]: 111: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,634 INFO L290 TraceCheckUtils]: 110: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,634 INFO L272 TraceCheckUtils]: 109: Hoare triple {43257#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,635 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42692#true} {43257#(< ~counter~0 48)} #84#return; {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,635 INFO L290 TraceCheckUtils]: 107: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,635 INFO L290 TraceCheckUtils]: 106: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,635 INFO L290 TraceCheckUtils]: 105: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,635 INFO L272 TraceCheckUtils]: 104: Hoare triple {43257#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,635 INFO L290 TraceCheckUtils]: 103: Hoare triple {43257#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,636 INFO L290 TraceCheckUtils]: 102: Hoare triple {43300#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43257#(< ~counter~0 48)} is VALID [2022-04-15 09:57:55,636 INFO L290 TraceCheckUtils]: 101: Hoare triple {43300#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,637 INFO L290 TraceCheckUtils]: 100: Hoare triple {43300#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,637 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42692#true} {43300#(< ~counter~0 47)} #86#return; {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,637 INFO L290 TraceCheckUtils]: 98: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,637 INFO L290 TraceCheckUtils]: 97: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,637 INFO L290 TraceCheckUtils]: 96: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,637 INFO L272 TraceCheckUtils]: 95: Hoare triple {43300#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,638 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42692#true} {43300#(< ~counter~0 47)} #84#return; {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,638 INFO L290 TraceCheckUtils]: 93: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,638 INFO L290 TraceCheckUtils]: 92: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,638 INFO L290 TraceCheckUtils]: 91: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,638 INFO L272 TraceCheckUtils]: 90: Hoare triple {43300#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {43300#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {43343#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43300#(< ~counter~0 47)} is VALID [2022-04-15 09:57:55,639 INFO L290 TraceCheckUtils]: 87: Hoare triple {43343#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {43343#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,640 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42692#true} {43343#(< ~counter~0 46)} #86#return; {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,640 INFO L290 TraceCheckUtils]: 82: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,640 INFO L272 TraceCheckUtils]: 81: Hoare triple {43343#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,640 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42692#true} {43343#(< ~counter~0 46)} #84#return; {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,640 INFO L290 TraceCheckUtils]: 79: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,640 INFO L290 TraceCheckUtils]: 78: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,641 INFO L272 TraceCheckUtils]: 76: Hoare triple {43343#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,641 INFO L290 TraceCheckUtils]: 75: Hoare triple {43343#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {43386#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43343#(< ~counter~0 46)} is VALID [2022-04-15 09:57:55,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {43386#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {43386#(< ~counter~0 45)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,642 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42692#true} {43386#(< ~counter~0 45)} #86#return; {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L272 TraceCheckUtils]: 67: Hoare triple {43386#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42692#true} {43386#(< ~counter~0 45)} #84#return; {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L290 TraceCheckUtils]: 63: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,643 INFO L272 TraceCheckUtils]: 62: Hoare triple {43386#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {43386#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {43429#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43386#(< ~counter~0 45)} is VALID [2022-04-15 09:57:55,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {43429#(< ~counter~0 44)} assume !(~r~0 >= ~d~0); {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,645 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42692#true} {43429#(< ~counter~0 44)} #82#return; {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,645 INFO L272 TraceCheckUtils]: 54: Hoare triple {43429#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42692#true} {43429#(< ~counter~0 44)} #80#return; {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L272 TraceCheckUtils]: 49: Hoare triple {43429#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42692#true} {43429#(< ~counter~0 44)} #78#return; {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,646 INFO L272 TraceCheckUtils]: 44: Hoare triple {43429#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {43429#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {43484#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43429#(< ~counter~0 44)} is VALID [2022-04-15 09:57:55,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {43484#(< ~counter~0 43)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,648 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42692#true} {43484#(< ~counter~0 43)} #82#return; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,648 INFO L272 TraceCheckUtils]: 36: Hoare triple {43484#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,652 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42692#true} {43484#(< ~counter~0 43)} #80#return; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,652 INFO L272 TraceCheckUtils]: 31: Hoare triple {43484#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,652 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42692#true} {43484#(< ~counter~0 43)} #78#return; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,653 INFO L272 TraceCheckUtils]: 26: Hoare triple {43484#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {43484#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {43539#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43484#(< ~counter~0 43)} is VALID [2022-04-15 09:57:55,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {43539#(< ~counter~0 42)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,655 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42692#true} {43539#(< ~counter~0 42)} #82#return; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,655 INFO L272 TraceCheckUtils]: 18: Hoare triple {43539#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,655 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42692#true} {43539#(< ~counter~0 42)} #80#return; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L272 TraceCheckUtils]: 13: Hoare triple {43539#(< ~counter~0 42)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42692#true} {43539#(< ~counter~0 42)} #78#return; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {42692#true} assume true; {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {42692#true} assume !(0 == ~cond); {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {42692#true} ~cond := #in~cond; {42692#true} is VALID [2022-04-15 09:57:55,656 INFO L272 TraceCheckUtils]: 8: Hoare triple {43539#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42692#true} is VALID [2022-04-15 09:57:55,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {43539#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {43594#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43539#(< ~counter~0 42)} is VALID [2022-04-15 09:57:55,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {43594#(< ~counter~0 41)} 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; {43594#(< ~counter~0 41)} is VALID [2022-04-15 09:57:55,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {43594#(< ~counter~0 41)} call #t~ret7 := main(); {43594#(< ~counter~0 41)} is VALID [2022-04-15 09:57:55,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43594#(< ~counter~0 41)} {42692#true} #92#return; {43594#(< ~counter~0 41)} is VALID [2022-04-15 09:57:55,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {43594#(< ~counter~0 41)} assume true; {43594#(< ~counter~0 41)} is VALID [2022-04-15 09:57:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {42692#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; {43594#(< ~counter~0 41)} is VALID [2022-04-15 09:57:55,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {42692#true} call ULTIMATE.init(); {42692#true} is VALID [2022-04-15 09:57:55,659 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-15 09:57:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:57:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000674967] [2022-04-15 09:57:55,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:57:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258113104] [2022-04-15 09:57:55,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258113104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:57:55,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:57:55,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 09:57:55,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:57:55,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235227668] [2022-04-15 09:57:55,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235227668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:57:55,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:57:55,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:57:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683664607] [2022-04-15 09:57:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:57:55,661 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-15 09:57:55,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:57:55,661 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-15 09:57:55,764 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-15 09:57:55,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:57:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:55,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:57:55,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:57:55,765 INFO L87 Difference]: Start difference. First operand 479 states and 529 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-15 09:57:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:57,358 INFO L93 Difference]: Finished difference Result 581 states and 653 transitions. [2022-04-15 09:57:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 09:57:57,358 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-15 09:57:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:57:57,358 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-15 09:57:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-15 09:57:57,360 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-15 09:57:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-15 09:57:57,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 216 transitions. [2022-04-15 09:57:57,532 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-15 09:57:57,546 INFO L225 Difference]: With dead ends: 581 [2022-04-15 09:57:57,546 INFO L226 Difference]: Without dead ends: 568 [2022-04-15 09:57:57,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=514, Unknown=0, NotChecked=0, Total=870 [2022-04-15 09:57:57,547 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 118 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:57:57,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 244 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:57:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-15 09:57:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 567. [2022-04-15 09:57:58,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:57:58,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-15 09:57:58,412 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-15 09:57:58,412 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-15 09:57:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:58,422 INFO L93 Difference]: Finished difference Result 568 states and 632 transitions. [2022-04-15 09:57:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 632 transitions. [2022-04-15 09:57:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:58,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:58,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 568 states. [2022-04-15 09:57:58,423 INFO L87 Difference]: Start difference. First operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 568 states. [2022-04-15 09:57:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:57:58,433 INFO L93 Difference]: Finished difference Result 568 states and 632 transitions. [2022-04-15 09:57:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 632 transitions. [2022-04-15 09:57:58,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:57:58,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:57:58,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:57:58,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:57:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 391 states have (on average 1.10230179028133) internal successors, (431), 398 states have internal predecessors, (431), 101 states have call successors, (101), 75 states have call predecessors, (101), 74 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-15 09:57:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 631 transitions. [2022-04-15 09:57:58,448 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 631 transitions. Word has length 150 [2022-04-15 09:57:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:57:58,448 INFO L478 AbstractCegarLoop]: Abstraction has 567 states and 631 transitions. [2022-04-15 09:57:58,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-15 09:57:58,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 631 transitions. [2022-04-15 09:57:59,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:57:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 631 transitions. [2022-04-15 09:57:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 09:57:59,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:57:59,797 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 8, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:57:59,813 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-15 09:57:59,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:57:59,998 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:57:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:57:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 15 times [2022-04-15 09:57:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:57:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811540740] [2022-04-15 09:58:04,099 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:58:04,099 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:58:04,099 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:58:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 16 times [2022-04-15 09:58:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:58:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024574860] [2022-04-15 09:58:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:58:04,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:58:04,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:58:04,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048663859] [2022-04-15 09:58:04,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:58:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:04,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:58:04,124 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-15 09:58:04,125 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-15 09:58:10,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:58:10,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:58:10,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:58:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:58:10,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:58:11,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {47059#true} call ULTIMATE.init(); {47059#true} is VALID [2022-04-15 09:58:11,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {47059#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; {47067#(<= ~counter~0 0)} is VALID [2022-04-15 09:58:11,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {47067#(<= ~counter~0 0)} assume true; {47067#(<= ~counter~0 0)} is VALID [2022-04-15 09:58:11,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47067#(<= ~counter~0 0)} {47059#true} #92#return; {47067#(<= ~counter~0 0)} is VALID [2022-04-15 09:58:11,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {47067#(<= ~counter~0 0)} call #t~ret7 := main(); {47067#(<= ~counter~0 0)} is VALID [2022-04-15 09:58:11,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {47067#(<= ~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; {47067#(<= ~counter~0 0)} is VALID [2022-04-15 09:58:11,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {47067#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {47083#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,615 INFO L272 TraceCheckUtils]: 8: Hoare triple {47083#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {47083#(<= ~counter~0 1)} ~cond := #in~cond; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {47083#(<= ~counter~0 1)} assume !(0 == ~cond); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {47083#(<= ~counter~0 1)} assume true; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {47083#(<= ~counter~0 1)} {47083#(<= ~counter~0 1)} #78#return; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,616 INFO L272 TraceCheckUtils]: 13: Hoare triple {47083#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {47083#(<= ~counter~0 1)} ~cond := #in~cond; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {47083#(<= ~counter~0 1)} assume !(0 == ~cond); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {47083#(<= ~counter~0 1)} assume true; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,617 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {47083#(<= ~counter~0 1)} {47083#(<= ~counter~0 1)} #80#return; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,618 INFO L272 TraceCheckUtils]: 18: Hoare triple {47083#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {47083#(<= ~counter~0 1)} ~cond := #in~cond; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {47083#(<= ~counter~0 1)} assume !(0 == ~cond); {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {47083#(<= ~counter~0 1)} assume true; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,619 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47083#(<= ~counter~0 1)} {47083#(<= ~counter~0 1)} #82#return; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {47083#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47083#(<= ~counter~0 1)} is VALID [2022-04-15 09:58:11,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {47083#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {47138#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,620 INFO L272 TraceCheckUtils]: 26: Hoare triple {47138#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {47138#(<= ~counter~0 2)} ~cond := #in~cond; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {47138#(<= ~counter~0 2)} assume !(0 == ~cond); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {47138#(<= ~counter~0 2)} assume true; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,622 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {47138#(<= ~counter~0 2)} {47138#(<= ~counter~0 2)} #78#return; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,622 INFO L272 TraceCheckUtils]: 31: Hoare triple {47138#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {47138#(<= ~counter~0 2)} ~cond := #in~cond; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {47138#(<= ~counter~0 2)} assume !(0 == ~cond); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {47138#(<= ~counter~0 2)} assume true; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,623 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {47138#(<= ~counter~0 2)} {47138#(<= ~counter~0 2)} #80#return; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,624 INFO L272 TraceCheckUtils]: 36: Hoare triple {47138#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {47138#(<= ~counter~0 2)} ~cond := #in~cond; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {47138#(<= ~counter~0 2)} assume !(0 == ~cond); {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {47138#(<= ~counter~0 2)} assume true; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,625 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47138#(<= ~counter~0 2)} {47138#(<= ~counter~0 2)} #82#return; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {47138#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47138#(<= ~counter~0 2)} is VALID [2022-04-15 09:58:11,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {47138#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {47193#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,626 INFO L272 TraceCheckUtils]: 44: Hoare triple {47193#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {47193#(<= ~counter~0 3)} ~cond := #in~cond; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {47193#(<= ~counter~0 3)} assume !(0 == ~cond); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {47193#(<= ~counter~0 3)} assume true; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,628 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47193#(<= ~counter~0 3)} {47193#(<= ~counter~0 3)} #78#return; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,628 INFO L272 TraceCheckUtils]: 49: Hoare triple {47193#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {47193#(<= ~counter~0 3)} ~cond := #in~cond; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {47193#(<= ~counter~0 3)} assume !(0 == ~cond); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {47193#(<= ~counter~0 3)} assume true; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,629 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47193#(<= ~counter~0 3)} {47193#(<= ~counter~0 3)} #80#return; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,630 INFO L272 TraceCheckUtils]: 54: Hoare triple {47193#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {47193#(<= ~counter~0 3)} ~cond := #in~cond; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {47193#(<= ~counter~0 3)} assume !(0 == ~cond); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {47193#(<= ~counter~0 3)} assume true; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,631 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47193#(<= ~counter~0 3)} {47193#(<= ~counter~0 3)} #82#return; {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {47193#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {47193#(<= ~counter~0 3)} is VALID [2022-04-15 09:58:11,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {47193#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {47248#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,632 INFO L272 TraceCheckUtils]: 62: Hoare triple {47248#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {47248#(<= ~counter~0 4)} ~cond := #in~cond; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {47248#(<= ~counter~0 4)} assume !(0 == ~cond); {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {47248#(<= ~counter~0 4)} assume true; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,634 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47248#(<= ~counter~0 4)} {47248#(<= ~counter~0 4)} #84#return; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,634 INFO L272 TraceCheckUtils]: 67: Hoare triple {47248#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,634 INFO L290 TraceCheckUtils]: 68: Hoare triple {47248#(<= ~counter~0 4)} ~cond := #in~cond; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {47248#(<= ~counter~0 4)} assume !(0 == ~cond); {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {47248#(<= ~counter~0 4)} assume true; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,635 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47248#(<= ~counter~0 4)} {47248#(<= ~counter~0 4)} #86#return; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {47248#(<= ~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); {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {47248#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47248#(<= ~counter~0 4)} is VALID [2022-04-15 09:58:11,636 INFO L290 TraceCheckUtils]: 74: Hoare triple {47248#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {47291#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,637 INFO L272 TraceCheckUtils]: 76: Hoare triple {47291#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {47291#(<= ~counter~0 5)} ~cond := #in~cond; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,638 INFO L290 TraceCheckUtils]: 78: Hoare triple {47291#(<= ~counter~0 5)} assume !(0 == ~cond); {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {47291#(<= ~counter~0 5)} assume true; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,639 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47291#(<= ~counter~0 5)} {47291#(<= ~counter~0 5)} #84#return; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,639 INFO L272 TraceCheckUtils]: 81: Hoare triple {47291#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,639 INFO L290 TraceCheckUtils]: 82: Hoare triple {47291#(<= ~counter~0 5)} ~cond := #in~cond; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,639 INFO L290 TraceCheckUtils]: 83: Hoare triple {47291#(<= ~counter~0 5)} assume !(0 == ~cond); {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {47291#(<= ~counter~0 5)} assume true; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,640 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47291#(<= ~counter~0 5)} {47291#(<= ~counter~0 5)} #86#return; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {47291#(<= ~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); {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,641 INFO L290 TraceCheckUtils]: 87: Hoare triple {47291#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47291#(<= ~counter~0 5)} is VALID [2022-04-15 09:58:11,641 INFO L290 TraceCheckUtils]: 88: Hoare triple {47291#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {47334#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,642 INFO L272 TraceCheckUtils]: 90: Hoare triple {47334#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {47334#(<= ~counter~0 6)} ~cond := #in~cond; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,643 INFO L290 TraceCheckUtils]: 92: Hoare triple {47334#(<= ~counter~0 6)} assume !(0 == ~cond); {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,643 INFO L290 TraceCheckUtils]: 93: Hoare triple {47334#(<= ~counter~0 6)} assume true; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,643 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47334#(<= ~counter~0 6)} {47334#(<= ~counter~0 6)} #84#return; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,644 INFO L272 TraceCheckUtils]: 95: Hoare triple {47334#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,644 INFO L290 TraceCheckUtils]: 96: Hoare triple {47334#(<= ~counter~0 6)} ~cond := #in~cond; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,644 INFO L290 TraceCheckUtils]: 97: Hoare triple {47334#(<= ~counter~0 6)} assume !(0 == ~cond); {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,645 INFO L290 TraceCheckUtils]: 98: Hoare triple {47334#(<= ~counter~0 6)} assume true; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,645 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47334#(<= ~counter~0 6)} {47334#(<= ~counter~0 6)} #86#return; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {47334#(<= ~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); {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,646 INFO L290 TraceCheckUtils]: 101: Hoare triple {47334#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47334#(<= ~counter~0 6)} is VALID [2022-04-15 09:58:11,646 INFO L290 TraceCheckUtils]: 102: Hoare triple {47334#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,646 INFO L290 TraceCheckUtils]: 103: Hoare triple {47377#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,647 INFO L272 TraceCheckUtils]: 104: Hoare triple {47377#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,647 INFO L290 TraceCheckUtils]: 105: Hoare triple {47377#(<= ~counter~0 7)} ~cond := #in~cond; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,647 INFO L290 TraceCheckUtils]: 106: Hoare triple {47377#(<= ~counter~0 7)} assume !(0 == ~cond); {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,648 INFO L290 TraceCheckUtils]: 107: Hoare triple {47377#(<= ~counter~0 7)} assume true; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,648 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47377#(<= ~counter~0 7)} {47377#(<= ~counter~0 7)} #84#return; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,649 INFO L272 TraceCheckUtils]: 109: Hoare triple {47377#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,649 INFO L290 TraceCheckUtils]: 110: Hoare triple {47377#(<= ~counter~0 7)} ~cond := #in~cond; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,649 INFO L290 TraceCheckUtils]: 111: Hoare triple {47377#(<= ~counter~0 7)} assume !(0 == ~cond); {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,649 INFO L290 TraceCheckUtils]: 112: Hoare triple {47377#(<= ~counter~0 7)} assume true; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,650 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47377#(<= ~counter~0 7)} {47377#(<= ~counter~0 7)} #86#return; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,650 INFO L290 TraceCheckUtils]: 114: Hoare triple {47377#(<= ~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); {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,650 INFO L290 TraceCheckUtils]: 115: Hoare triple {47377#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47377#(<= ~counter~0 7)} is VALID [2022-04-15 09:58:11,651 INFO L290 TraceCheckUtils]: 116: Hoare triple {47377#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,651 INFO L290 TraceCheckUtils]: 117: Hoare triple {47420#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,652 INFO L272 TraceCheckUtils]: 118: Hoare triple {47420#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,652 INFO L290 TraceCheckUtils]: 119: Hoare triple {47420#(<= ~counter~0 8)} ~cond := #in~cond; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,652 INFO L290 TraceCheckUtils]: 120: Hoare triple {47420#(<= ~counter~0 8)} assume !(0 == ~cond); {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,653 INFO L290 TraceCheckUtils]: 121: Hoare triple {47420#(<= ~counter~0 8)} assume true; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,653 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47420#(<= ~counter~0 8)} {47420#(<= ~counter~0 8)} #84#return; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,653 INFO L272 TraceCheckUtils]: 123: Hoare triple {47420#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,654 INFO L290 TraceCheckUtils]: 124: Hoare triple {47420#(<= ~counter~0 8)} ~cond := #in~cond; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,654 INFO L290 TraceCheckUtils]: 125: Hoare triple {47420#(<= ~counter~0 8)} assume !(0 == ~cond); {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,654 INFO L290 TraceCheckUtils]: 126: Hoare triple {47420#(<= ~counter~0 8)} assume true; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,655 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47420#(<= ~counter~0 8)} {47420#(<= ~counter~0 8)} #86#return; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,655 INFO L290 TraceCheckUtils]: 128: Hoare triple {47420#(<= ~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); {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,655 INFO L290 TraceCheckUtils]: 129: Hoare triple {47420#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47420#(<= ~counter~0 8)} is VALID [2022-04-15 09:58:11,656 INFO L290 TraceCheckUtils]: 130: Hoare triple {47420#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,656 INFO L290 TraceCheckUtils]: 131: Hoare triple {47463#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,657 INFO L272 TraceCheckUtils]: 132: Hoare triple {47463#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,657 INFO L290 TraceCheckUtils]: 133: Hoare triple {47463#(<= ~counter~0 9)} ~cond := #in~cond; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,657 INFO L290 TraceCheckUtils]: 134: Hoare triple {47463#(<= ~counter~0 9)} assume !(0 == ~cond); {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,657 INFO L290 TraceCheckUtils]: 135: Hoare triple {47463#(<= ~counter~0 9)} assume true; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,658 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47463#(<= ~counter~0 9)} {47463#(<= ~counter~0 9)} #84#return; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,658 INFO L272 TraceCheckUtils]: 137: Hoare triple {47463#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,658 INFO L290 TraceCheckUtils]: 138: Hoare triple {47463#(<= ~counter~0 9)} ~cond := #in~cond; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,659 INFO L290 TraceCheckUtils]: 139: Hoare triple {47463#(<= ~counter~0 9)} assume !(0 == ~cond); {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,659 INFO L290 TraceCheckUtils]: 140: Hoare triple {47463#(<= ~counter~0 9)} assume true; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,659 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47463#(<= ~counter~0 9)} {47463#(<= ~counter~0 9)} #86#return; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,660 INFO L290 TraceCheckUtils]: 142: Hoare triple {47463#(<= ~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); {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,660 INFO L290 TraceCheckUtils]: 143: Hoare triple {47463#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47463#(<= ~counter~0 9)} is VALID [2022-04-15 09:58:11,661 INFO L290 TraceCheckUtils]: 144: Hoare triple {47463#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,661 INFO L290 TraceCheckUtils]: 145: Hoare triple {47506#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,661 INFO L272 TraceCheckUtils]: 146: Hoare triple {47506#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,662 INFO L290 TraceCheckUtils]: 147: Hoare triple {47506#(<= ~counter~0 10)} ~cond := #in~cond; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,662 INFO L290 TraceCheckUtils]: 148: Hoare triple {47506#(<= ~counter~0 10)} assume !(0 == ~cond); {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,662 INFO L290 TraceCheckUtils]: 149: Hoare triple {47506#(<= ~counter~0 10)} assume true; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,663 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47506#(<= ~counter~0 10)} {47506#(<= ~counter~0 10)} #84#return; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,663 INFO L272 TraceCheckUtils]: 151: Hoare triple {47506#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,663 INFO L290 TraceCheckUtils]: 152: Hoare triple {47506#(<= ~counter~0 10)} ~cond := #in~cond; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,664 INFO L290 TraceCheckUtils]: 153: Hoare triple {47506#(<= ~counter~0 10)} assume !(0 == ~cond); {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,664 INFO L290 TraceCheckUtils]: 154: Hoare triple {47506#(<= ~counter~0 10)} assume true; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,664 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47506#(<= ~counter~0 10)} {47506#(<= ~counter~0 10)} #86#return; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,665 INFO L290 TraceCheckUtils]: 156: Hoare triple {47506#(<= ~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); {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,665 INFO L290 TraceCheckUtils]: 157: Hoare triple {47506#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47506#(<= ~counter~0 10)} is VALID [2022-04-15 09:58:11,665 INFO L290 TraceCheckUtils]: 158: Hoare triple {47506#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47549#(<= |main_#t~post6| 10)} is VALID [2022-04-15 09:58:11,666 INFO L290 TraceCheckUtils]: 159: Hoare triple {47549#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {47060#false} is VALID [2022-04-15 09:58:11,666 INFO L272 TraceCheckUtils]: 160: Hoare triple {47060#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {47060#false} is VALID [2022-04-15 09:58:11,666 INFO L290 TraceCheckUtils]: 161: Hoare triple {47060#false} ~cond := #in~cond; {47060#false} is VALID [2022-04-15 09:58:11,666 INFO L290 TraceCheckUtils]: 162: Hoare triple {47060#false} assume 0 == ~cond; {47060#false} is VALID [2022-04-15 09:58:11,666 INFO L290 TraceCheckUtils]: 163: Hoare triple {47060#false} assume !false; {47060#false} is VALID [2022-04-15 09:58:11,666 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-15 09:58:11,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:58:12,486 INFO L290 TraceCheckUtils]: 163: Hoare triple {47060#false} assume !false; {47060#false} is VALID [2022-04-15 09:58:12,486 INFO L290 TraceCheckUtils]: 162: Hoare triple {47060#false} assume 0 == ~cond; {47060#false} is VALID [2022-04-15 09:58:12,486 INFO L290 TraceCheckUtils]: 161: Hoare triple {47060#false} ~cond := #in~cond; {47060#false} is VALID [2022-04-15 09:58:12,486 INFO L272 TraceCheckUtils]: 160: Hoare triple {47060#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {47060#false} is VALID [2022-04-15 09:58:12,486 INFO L290 TraceCheckUtils]: 159: Hoare triple {47577#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {47060#false} is VALID [2022-04-15 09:58:12,487 INFO L290 TraceCheckUtils]: 158: Hoare triple {47581#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47577#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:58:12,487 INFO L290 TraceCheckUtils]: 157: Hoare triple {47581#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,487 INFO L290 TraceCheckUtils]: 156: Hoare triple {47581#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,488 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47059#true} {47581#(< ~counter~0 50)} #86#return; {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,488 INFO L290 TraceCheckUtils]: 154: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,488 INFO L290 TraceCheckUtils]: 153: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,488 INFO L290 TraceCheckUtils]: 152: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,488 INFO L272 TraceCheckUtils]: 151: Hoare triple {47581#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,488 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47059#true} {47581#(< ~counter~0 50)} #84#return; {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,488 INFO L290 TraceCheckUtils]: 149: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,488 INFO L290 TraceCheckUtils]: 148: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,489 INFO L290 TraceCheckUtils]: 147: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,489 INFO L272 TraceCheckUtils]: 146: Hoare triple {47581#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,489 INFO L290 TraceCheckUtils]: 145: Hoare triple {47581#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,490 INFO L290 TraceCheckUtils]: 144: Hoare triple {47624#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47581#(< ~counter~0 50)} is VALID [2022-04-15 09:58:12,490 INFO L290 TraceCheckUtils]: 143: Hoare triple {47624#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,491 INFO L290 TraceCheckUtils]: 142: Hoare triple {47624#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,491 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {47059#true} {47624#(< ~counter~0 49)} #86#return; {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,491 INFO L290 TraceCheckUtils]: 140: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,491 INFO L290 TraceCheckUtils]: 139: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,491 INFO L290 TraceCheckUtils]: 138: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,491 INFO L272 TraceCheckUtils]: 137: Hoare triple {47624#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,492 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {47059#true} {47624#(< ~counter~0 49)} #84#return; {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,492 INFO L290 TraceCheckUtils]: 135: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,492 INFO L290 TraceCheckUtils]: 134: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,492 INFO L290 TraceCheckUtils]: 133: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,492 INFO L272 TraceCheckUtils]: 132: Hoare triple {47624#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,492 INFO L290 TraceCheckUtils]: 131: Hoare triple {47624#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,493 INFO L290 TraceCheckUtils]: 130: Hoare triple {47667#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47624#(< ~counter~0 49)} is VALID [2022-04-15 09:58:12,493 INFO L290 TraceCheckUtils]: 129: Hoare triple {47667#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {47667#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,494 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {47059#true} {47667#(< ~counter~0 48)} #86#return; {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,494 INFO L290 TraceCheckUtils]: 125: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,494 INFO L290 TraceCheckUtils]: 124: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,494 INFO L272 TraceCheckUtils]: 123: Hoare triple {47667#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,495 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {47059#true} {47667#(< ~counter~0 48)} #84#return; {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,495 INFO L290 TraceCheckUtils]: 121: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,495 INFO L290 TraceCheckUtils]: 120: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,495 INFO L290 TraceCheckUtils]: 119: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,495 INFO L272 TraceCheckUtils]: 118: Hoare triple {47667#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,495 INFO L290 TraceCheckUtils]: 117: Hoare triple {47667#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,496 INFO L290 TraceCheckUtils]: 116: Hoare triple {47710#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47667#(< ~counter~0 48)} is VALID [2022-04-15 09:58:12,496 INFO L290 TraceCheckUtils]: 115: Hoare triple {47710#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,496 INFO L290 TraceCheckUtils]: 114: Hoare triple {47710#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,497 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {47059#true} {47710#(< ~counter~0 47)} #86#return; {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,497 INFO L290 TraceCheckUtils]: 112: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,497 INFO L290 TraceCheckUtils]: 111: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,497 INFO L290 TraceCheckUtils]: 110: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,497 INFO L272 TraceCheckUtils]: 109: Hoare triple {47710#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,498 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {47059#true} {47710#(< ~counter~0 47)} #84#return; {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,498 INFO L290 TraceCheckUtils]: 107: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,498 INFO L290 TraceCheckUtils]: 106: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,498 INFO L290 TraceCheckUtils]: 105: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,498 INFO L272 TraceCheckUtils]: 104: Hoare triple {47710#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {47710#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {47753#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47710#(< ~counter~0 47)} is VALID [2022-04-15 09:58:12,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {47753#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {47753#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,500 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {47059#true} {47753#(< ~counter~0 46)} #86#return; {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,500 INFO L290 TraceCheckUtils]: 98: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,500 INFO L290 TraceCheckUtils]: 97: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,500 INFO L272 TraceCheckUtils]: 95: Hoare triple {47753#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,500 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {47059#true} {47753#(< ~counter~0 46)} #84#return; {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,501 INFO L290 TraceCheckUtils]: 91: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,501 INFO L272 TraceCheckUtils]: 90: Hoare triple {47753#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,501 INFO L290 TraceCheckUtils]: 89: Hoare triple {47753#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {47796#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47753#(< ~counter~0 46)} is VALID [2022-04-15 09:58:12,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {47796#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {47796#(< ~counter~0 45)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,503 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {47059#true} {47796#(< ~counter~0 45)} #86#return; {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,503 INFO L290 TraceCheckUtils]: 84: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,503 INFO L290 TraceCheckUtils]: 83: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,503 INFO L290 TraceCheckUtils]: 82: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,503 INFO L272 TraceCheckUtils]: 81: Hoare triple {47796#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,503 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {47059#true} {47796#(< ~counter~0 45)} #84#return; {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,504 INFO L272 TraceCheckUtils]: 76: Hoare triple {47796#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {47796#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {47839#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47796#(< ~counter~0 45)} is VALID [2022-04-15 09:58:12,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {47839#(< ~counter~0 44)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,505 INFO L290 TraceCheckUtils]: 72: Hoare triple {47839#(< ~counter~0 44)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,505 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47059#true} {47839#(< ~counter~0 44)} #86#return; {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L272 TraceCheckUtils]: 67: Hoare triple {47839#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {47059#true} {47839#(< ~counter~0 44)} #84#return; {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,507 INFO L272 TraceCheckUtils]: 62: Hoare triple {47839#(< ~counter~0 44)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {47839#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {47882#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47839#(< ~counter~0 44)} is VALID [2022-04-15 09:58:12,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {47882#(< ~counter~0 43)} assume !(~r~0 >= ~d~0); {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,508 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {47059#true} {47882#(< ~counter~0 43)} #82#return; {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,508 INFO L272 TraceCheckUtils]: 54: Hoare triple {47882#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,509 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {47059#true} {47882#(< ~counter~0 43)} #80#return; {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,509 INFO L290 TraceCheckUtils]: 52: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,509 INFO L272 TraceCheckUtils]: 49: Hoare triple {47882#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,509 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {47059#true} {47882#(< ~counter~0 43)} #78#return; {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,510 INFO L272 TraceCheckUtils]: 44: Hoare triple {47882#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {47882#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {47937#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47882#(< ~counter~0 43)} is VALID [2022-04-15 09:58:12,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {47937#(< ~counter~0 42)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,511 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47059#true} {47937#(< ~counter~0 42)} #82#return; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L272 TraceCheckUtils]: 36: Hoare triple {47937#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {47059#true} {47937#(< ~counter~0 42)} #80#return; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,512 INFO L272 TraceCheckUtils]: 31: Hoare triple {47937#(< ~counter~0 42)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,513 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {47059#true} {47937#(< ~counter~0 42)} #78#return; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,513 INFO L272 TraceCheckUtils]: 26: Hoare triple {47937#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {47937#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {47992#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47937#(< ~counter~0 42)} is VALID [2022-04-15 09:58:12,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {47992#(< ~counter~0 41)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,515 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47059#true} {47992#(< ~counter~0 41)} #82#return; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L272 TraceCheckUtils]: 18: Hoare triple {47992#(< ~counter~0 41)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {47059#true} {47992#(< ~counter~0 41)} #80#return; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L272 TraceCheckUtils]: 13: Hoare triple {47992#(< ~counter~0 41)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {47059#true} {47992#(< ~counter~0 41)} #78#return; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {47059#true} assume true; {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {47059#true} assume !(0 == ~cond); {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {47059#true} ~cond := #in~cond; {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L272 TraceCheckUtils]: 8: Hoare triple {47992#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {47059#true} is VALID [2022-04-15 09:58:12,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {47992#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {48047#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47992#(< ~counter~0 41)} is VALID [2022-04-15 09:58:12,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {48047#(< ~counter~0 40)} 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; {48047#(< ~counter~0 40)} is VALID [2022-04-15 09:58:12,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {48047#(< ~counter~0 40)} call #t~ret7 := main(); {48047#(< ~counter~0 40)} is VALID [2022-04-15 09:58:12,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48047#(< ~counter~0 40)} {47059#true} #92#return; {48047#(< ~counter~0 40)} is VALID [2022-04-15 09:58:12,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {48047#(< ~counter~0 40)} assume true; {48047#(< ~counter~0 40)} is VALID [2022-04-15 09:58:12,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {47059#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; {48047#(< ~counter~0 40)} is VALID [2022-04-15 09:58:12,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {47059#true} call ULTIMATE.init(); {47059#true} is VALID [2022-04-15 09:58:12,519 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-15 09:58:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:58:12,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024574860] [2022-04-15 09:58:12,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:58:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048663859] [2022-04-15 09:58:12,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048663859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:58:12,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:58:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 09:58:12,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:58:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811540740] [2022-04-15 09:58:12,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811540740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:58:12,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:58:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:58:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214170581] [2022-04-15 09:58:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:58:12,521 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-15 09:58:12,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:58:12,521 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-15 09:58:12,619 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-15 09:58:12,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:58:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:58:12,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 09:58:12,620 INFO L87 Difference]: Start difference. First operand 567 states and 631 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-15 09:58:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:14,599 INFO L93 Difference]: Finished difference Result 675 states and 762 transitions. [2022-04-15 09:58:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 09:58:14,599 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-15 09:58:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:58:14,599 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-15 09:58:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-15 09:58:14,601 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-15 09:58:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-15 09:58:14,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 239 transitions. [2022-04-15 09:58:14,759 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-15 09:58:14,778 INFO L225 Difference]: With dead ends: 675 [2022-04-15 09:58:14,778 INFO L226 Difference]: Without dead ends: 662 [2022-04-15 09:58:14,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=621, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 09:58:14,779 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:58:14,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 287 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:58:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-15 09:58:15,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 661. [2022-04-15 09:58:15,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:58:15,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-15 09:58:15,426 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-15 09:58:15,426 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-15 09:58:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:15,439 INFO L93 Difference]: Finished difference Result 662 states and 741 transitions. [2022-04-15 09:58:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 741 transitions. [2022-04-15 09:58:15,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:15,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:15,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 662 states. [2022-04-15 09:58:15,440 INFO L87 Difference]: Start difference. First operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 662 states. [2022-04-15 09:58:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:15,453 INFO L93 Difference]: Finished difference Result 662 states and 741 transitions. [2022-04-15 09:58:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 741 transitions. [2022-04-15 09:58:15,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:15,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:15,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:58:15,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:58:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 455 states have (on average 1.1032967032967034) internal successors, (502), 464 states have internal predecessors, (502), 120 states have call successors, (120), 86 states have call predecessors, (120), 85 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-15 09:58:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 740 transitions. [2022-04-15 09:58:15,484 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 740 transitions. Word has length 164 [2022-04-15 09:58:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:58:15,485 INFO L478 AbstractCegarLoop]: Abstraction has 661 states and 740 transitions. [2022-04-15 09:58:15,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-15 09:58:15,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 661 states and 740 transitions. [2022-04-15 09:58:17,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 740 edges. 740 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:58:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 740 transitions. [2022-04-15 09:58:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-15 09:58:17,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:58:17,079 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:58:17,087 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-15 09:58:17,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:17,280 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:58:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:58:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 17 times [2022-04-15 09:58:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:17,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789412657] [2022-04-15 09:58:21,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:58:21,371 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:58:21,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:58:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 18 times [2022-04-15 09:58:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:58:21,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028882257] [2022-04-15 09:58:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:58:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:58:21,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:58:21,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994577973] [2022-04-15 09:58:21,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:58:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:58:21,398 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-15 09:58:21,399 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-15 09:58:21,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 09:58:21,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:58:21,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:58:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:58:21,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:58:21,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {52078#true} call ULTIMATE.init(); {52078#true} is VALID [2022-04-15 09:58:21,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {52078#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; {52078#true} is VALID [2022-04-15 09:58:21,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52078#true} {52078#true} #92#return; {52078#true} is VALID [2022-04-15 09:58:21,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {52078#true} call #t~ret7 := main(); {52078#true} is VALID [2022-04-15 09:58:21,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {52078#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; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {52098#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {52098#(= main_~p~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,846 INFO L272 TraceCheckUtils]: 8: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #78#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,846 INFO L272 TraceCheckUtils]: 13: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,847 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #80#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,847 INFO L272 TraceCheckUtils]: 18: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,847 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #82#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {52098#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {52153#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {52153#(= main_~p~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,848 INFO L272 TraceCheckUtils]: 26: Hoare triple {52153#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,848 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {52078#true} {52153#(= main_~p~0 2)} #78#return; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,849 INFO L272 TraceCheckUtils]: 31: Hoare triple {52153#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {52078#true} {52153#(= main_~p~0 2)} #80#return; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,849 INFO L272 TraceCheckUtils]: 36: Hoare triple {52153#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,850 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {52078#true} {52153#(= main_~p~0 2)} #82#return; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {52153#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {52208#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {52208#(= main_~p~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,850 INFO L272 TraceCheckUtils]: 44: Hoare triple {52208#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {52078#true} {52208#(= main_~p~0 4)} #78#return; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,851 INFO L272 TraceCheckUtils]: 49: Hoare triple {52208#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {52078#true} {52208#(= main_~p~0 4)} #80#return; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,851 INFO L272 TraceCheckUtils]: 54: Hoare triple {52208#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,852 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {52078#true} {52208#(= main_~p~0 4)} #82#return; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {52208#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,852 INFO L290 TraceCheckUtils]: 60: Hoare triple {52208#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {52208#(= main_~p~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,852 INFO L272 TraceCheckUtils]: 62: Hoare triple {52208#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {52078#true} {52208#(= main_~p~0 4)} #84#return; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,853 INFO L272 TraceCheckUtils]: 67: Hoare triple {52208#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,853 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52078#true} {52208#(= main_~p~0 4)} #86#return; {52208#(= main_~p~0 4)} is VALID [2022-04-15 09:58:21,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {52208#(= 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); {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {52153#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {52153#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {52153#(= main_~p~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,855 INFO L272 TraceCheckUtils]: 76: Hoare triple {52153#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 79: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {52078#true} {52153#(= main_~p~0 2)} #84#return; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,855 INFO L272 TraceCheckUtils]: 81: Hoare triple {52153#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,856 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {52078#true} {52153#(= main_~p~0 2)} #86#return; {52153#(= main_~p~0 2)} is VALID [2022-04-15 09:58:21,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {52153#(= 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); {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {52098#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {52098#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {52098#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,856 INFO L272 TraceCheckUtils]: 90: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 91: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #84#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,857 INFO L272 TraceCheckUtils]: 95: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 96: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 97: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:21,857 INFO L290 TraceCheckUtils]: 98: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:21,858 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #86#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {52098#(= 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); {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L272 TraceCheckUtils]: 104: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 107: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {52079#false} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L272 TraceCheckUtils]: 109: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 110: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,858 INFO L290 TraceCheckUtils]: 111: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 112: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {52079#false} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 114: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 115: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 116: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 117: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L272 TraceCheckUtils]: 118: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 119: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 120: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 121: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {52079#false} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L272 TraceCheckUtils]: 123: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 124: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 125: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,859 INFO L290 TraceCheckUtils]: 126: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {52079#false} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 128: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 129: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 130: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 131: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L272 TraceCheckUtils]: 132: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 133: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 134: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 135: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {52079#false} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L272 TraceCheckUtils]: 137: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 138: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 139: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L290 TraceCheckUtils]: 140: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,860 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {52079#false} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 142: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 143: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 144: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 145: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L272 TraceCheckUtils]: 146: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 147: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 148: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 149: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {52079#false} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L272 TraceCheckUtils]: 151: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 152: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 153: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 154: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {52079#false} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:21,861 INFO L290 TraceCheckUtils]: 156: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 157: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 158: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 159: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L272 TraceCheckUtils]: 160: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 161: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 162: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 163: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {52079#false} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L272 TraceCheckUtils]: 165: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 166: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 167: Hoare triple {52079#false} assume !(0 == ~cond); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 168: Hoare triple {52079#false} assume true; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {52079#false} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 170: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 171: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:21,862 INFO L290 TraceCheckUtils]: 172: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,863 INFO L290 TraceCheckUtils]: 173: Hoare triple {52079#false} assume !(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:21,863 INFO L272 TraceCheckUtils]: 174: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:21,863 INFO L290 TraceCheckUtils]: 175: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:21,863 INFO L290 TraceCheckUtils]: 176: Hoare triple {52079#false} assume 0 == ~cond; {52079#false} is VALID [2022-04-15 09:58:21,863 INFO L290 TraceCheckUtils]: 177: Hoare triple {52079#false} assume !false; {52079#false} is VALID [2022-04-15 09:58:21,863 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-15 09:58:21,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:58:22,496 INFO L290 TraceCheckUtils]: 177: Hoare triple {52079#false} assume !false; {52079#false} is VALID [2022-04-15 09:58:22,502 INFO L290 TraceCheckUtils]: 176: Hoare triple {52079#false} assume 0 == ~cond; {52079#false} is VALID [2022-04-15 09:58:22,502 INFO L290 TraceCheckUtils]: 175: Hoare triple {52079#false} ~cond := #in~cond; {52079#false} is VALID [2022-04-15 09:58:22,502 INFO L272 TraceCheckUtils]: 174: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {52079#false} is VALID [2022-04-15 09:58:22,502 INFO L290 TraceCheckUtils]: 173: Hoare triple {52079#false} assume !(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,502 INFO L290 TraceCheckUtils]: 172: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 171: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 170: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {52078#true} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 168: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 167: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 166: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L272 TraceCheckUtils]: 165: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {52078#true} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 163: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 162: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 161: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L272 TraceCheckUtils]: 160: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 159: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 158: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,503 INFO L290 TraceCheckUtils]: 157: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 156: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {52078#true} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 154: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 153: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 152: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L272 TraceCheckUtils]: 151: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {52078#true} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 149: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 148: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 147: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L272 TraceCheckUtils]: 146: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 145: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 144: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,504 INFO L290 TraceCheckUtils]: 143: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 142: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {52078#true} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 140: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 139: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 138: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L272 TraceCheckUtils]: 137: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {52078#true} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 135: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L272 TraceCheckUtils]: 132: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 131: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 130: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,505 INFO L290 TraceCheckUtils]: 129: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 128: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {52078#true} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 126: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 125: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 124: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L272 TraceCheckUtils]: 123: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {52078#true} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 121: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 120: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 119: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L272 TraceCheckUtils]: 118: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 117: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 116: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 115: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L290 TraceCheckUtils]: 114: Hoare triple {52079#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); {52079#false} is VALID [2022-04-15 09:58:22,506 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {52078#true} {52079#false} #86#return; {52079#false} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 112: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 111: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 110: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L272 TraceCheckUtils]: 109: Hoare triple {52079#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {52078#true} {52079#false} #84#return; {52079#false} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 107: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 106: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 105: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L272 TraceCheckUtils]: 104: Hoare triple {52079#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {52079#false} assume !!(#t~post6 < 50);havoc #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 102: Hoare triple {52079#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52079#false} is VALID [2022-04-15 09:58:22,507 INFO L290 TraceCheckUtils]: 101: Hoare triple {52079#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52079#false} is VALID [2022-04-15 09:58:22,508 INFO L290 TraceCheckUtils]: 100: Hoare triple {52098#(= 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); {52079#false} is VALID [2022-04-15 09:58:22,508 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #86#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,508 INFO L290 TraceCheckUtils]: 98: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,508 INFO L290 TraceCheckUtils]: 97: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,508 INFO L290 TraceCheckUtils]: 96: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L272 TraceCheckUtils]: 95: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #84#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L290 TraceCheckUtils]: 91: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L272 TraceCheckUtils]: 90: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {52098#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {52098#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,510 INFO L290 TraceCheckUtils]: 87: Hoare triple {52098#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {52890#(= (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); {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,511 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {52078#true} {52890#(= (div main_~p~0 2) 1)} #86#return; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,511 INFO L290 TraceCheckUtils]: 84: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,511 INFO L290 TraceCheckUtils]: 83: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,511 INFO L290 TraceCheckUtils]: 82: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,511 INFO L272 TraceCheckUtils]: 81: Hoare triple {52890#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,512 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {52078#true} {52890#(= (div main_~p~0 2) 1)} #84#return; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 79: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,512 INFO L272 TraceCheckUtils]: 76: Hoare triple {52890#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {52890#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 50);havoc #t~post6; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {52890#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {52890#(= (div main_~p~0 2) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {52933#(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); {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,514 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52078#true} {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #86#return; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,514 INFO L272 TraceCheckUtils]: 67: Hoare triple {52933#(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)); {52078#true} is VALID [2022-04-15 09:58:22,515 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {52078#true} {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #84#return; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,515 INFO L290 TraceCheckUtils]: 65: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,515 INFO L290 TraceCheckUtils]: 64: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,515 INFO L272 TraceCheckUtils]: 62: Hoare triple {52933#(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)); {52078#true} is VALID [2022-04-15 09:58:22,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {52933#(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; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {52933#(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); {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,516 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {52078#true} {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #82#return; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,516 INFO L290 TraceCheckUtils]: 55: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,516 INFO L272 TraceCheckUtils]: 54: Hoare triple {52933#(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)); {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {52078#true} {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #80#return; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L272 TraceCheckUtils]: 49: Hoare triple {52933#(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)); {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {52078#true} {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #78#return; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,517 INFO L272 TraceCheckUtils]: 44: Hoare triple {52933#(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)); {52078#true} is VALID [2022-04-15 09:58:22,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post5 < 50);havoc #t~post5; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {52933#(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; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {52890#(= (div main_~p~0 2) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52933#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-15 09:58:22,520 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {52078#true} {52890#(= (div main_~p~0 2) 1)} #82#return; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,520 INFO L272 TraceCheckUtils]: 36: Hoare triple {52890#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,520 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {52078#true} {52890#(= (div main_~p~0 2) 1)} #80#return; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L272 TraceCheckUtils]: 31: Hoare triple {52890#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {52078#true} {52890#(= (div main_~p~0 2) 1)} #78#return; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L272 TraceCheckUtils]: 26: Hoare triple {52890#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {52890#(= (div main_~p~0 2) 1)} assume !!(#t~post5 < 50);havoc #t~post5; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {52890#(= (div main_~p~0 2) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {52098#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52890#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:58:22,522 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #82#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,522 INFO L272 TraceCheckUtils]: 18: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #80#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L272 TraceCheckUtils]: 13: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {52078#true} {52098#(= main_~p~0 1)} #78#return; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {52078#true} assume !(0 == ~cond); {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {52078#true} ~cond := #in~cond; {52078#true} is VALID [2022-04-15 09:58:22,523 INFO L272 TraceCheckUtils]: 8: Hoare triple {52098#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {52078#true} is VALID [2022-04-15 09:58:22,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {52098#(= main_~p~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {52098#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {52078#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; {52098#(= main_~p~0 1)} is VALID [2022-04-15 09:58:22,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {52078#true} call #t~ret7 := main(); {52078#true} is VALID [2022-04-15 09:58:22,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52078#true} {52078#true} #92#return; {52078#true} is VALID [2022-04-15 09:58:22,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {52078#true} assume true; {52078#true} is VALID [2022-04-15 09:58:22,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {52078#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; {52078#true} is VALID [2022-04-15 09:58:22,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {52078#true} call ULTIMATE.init(); {52078#true} is VALID [2022-04-15 09:58:22,525 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-15 09:58:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:58:22,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028882257] [2022-04-15 09:58:22,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:58:22,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994577973] [2022-04-15 09:58:22,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994577973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:58:22,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:58:22,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-15 09:58:22,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:58:22,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789412657] [2022-04-15 09:58:22,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789412657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:58:22,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:58:22,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:58:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848682770] [2022-04-15 09:58:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:58:22,526 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-15 09:58:22,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:58:22,527 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-15 09:58:22,576 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-15 09:58:22,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:58:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:58:22,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 09:58:22,576 INFO L87 Difference]: Start difference. First operand 661 states and 740 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-15 09:58:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:23,506 INFO L93 Difference]: Finished difference Result 717 states and 805 transitions. [2022-04-15 09:58:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:58:23,506 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-15 09:58:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:58:23,506 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-15 09:58:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-15 09:58:23,507 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-15 09:58:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-15 09:58:23,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-04-15 09:58:23,573 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-15 09:58:23,592 INFO L225 Difference]: With dead ends: 717 [2022-04-15 09:58:23,592 INFO L226 Difference]: Without dead ends: 563 [2022-04-15 09:58:23,593 INFO L912 BasicCegarLoop]: 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-15 09:58:23,593 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:58:23,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:58:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-04-15 09:58:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2022-04-15 09:58:24,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:58:24,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-15 09:58:24,475 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-15 09:58:24,476 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-15 09:58:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:24,486 INFO L93 Difference]: Finished difference Result 563 states and 627 transitions. [2022-04-15 09:58:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-15 09:58:24,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:24,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:24,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 563 states. [2022-04-15 09:58:24,487 INFO L87 Difference]: Start difference. First operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 563 states. [2022-04-15 09:58:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:24,498 INFO L93 Difference]: Finished difference Result 563 states and 627 transitions. [2022-04-15 09:58:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-15 09:58:24,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:24,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:24,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:58:24,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:58:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 386 states have (on average 1.1010362694300517) internal successors, (425), 394 states have internal predecessors, (425), 102 states have call successors, (102), 75 states have call predecessors, (102), 74 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-15 09:58:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 627 transitions. [2022-04-15 09:58:24,513 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 627 transitions. Word has length 178 [2022-04-15 09:58:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:58:24,513 INFO L478 AbstractCegarLoop]: Abstraction has 563 states and 627 transitions. [2022-04-15 09:58:24,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-15 09:58:24,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 563 states and 627 transitions. [2022-04-15 09:58:26,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:58:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2022-04-15 09:58:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-15 09:58:26,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:58:26,077 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:58:26,094 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-15 09:58:26,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:26,293 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:58:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:58:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 5 times [2022-04-15 09:58:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:26,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877475350] [2022-04-15 09:58:28,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:58:28,601 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:58:28,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:58:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 6 times [2022-04-15 09:58:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:58:28,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993362918] [2022-04-15 09:58:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:58:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:58:28,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:58:28,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689936315] [2022-04-15 09:58:28,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:58:28,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:58:28,630 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-15 09:58:28,631 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-15 09:58:28,699 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 09:58:28,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:58:28,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 09:58:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:58:28,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:58:29,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {56838#true} call ULTIMATE.init(); {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {56838#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; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56838#true} {56838#true} #92#return; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {56838#true} call #t~ret7 := main(); {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {56838#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; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L272 TraceCheckUtils]: 13: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L272 TraceCheckUtils]: 26: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L272 TraceCheckUtils]: 31: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L272 TraceCheckUtils]: 36: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L272 TraceCheckUtils]: 44: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L272 TraceCheckUtils]: 49: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,057 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L272 TraceCheckUtils]: 54: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L272 TraceCheckUtils]: 62: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L272 TraceCheckUtils]: 67: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L272 TraceCheckUtils]: 72: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 77: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 78: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 79: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L272 TraceCheckUtils]: 80: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 81: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 82: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,059 INFO L290 TraceCheckUtils]: 83: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L272 TraceCheckUtils]: 85: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 86: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 87: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 88: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L272 TraceCheckUtils]: 90: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 91: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 92: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 93: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 95: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 96: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 97: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L272 TraceCheckUtils]: 98: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,060 INFO L290 TraceCheckUtils]: 99: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 100: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 101: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L272 TraceCheckUtils]: 103: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 104: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 105: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 106: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L272 TraceCheckUtils]: 108: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 109: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 110: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 111: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,061 INFO L290 TraceCheckUtils]: 113: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 114: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 115: Hoare triple {56838#true} assume !!(#t~post5 < 50);havoc #t~post5; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L272 TraceCheckUtils]: 116: Hoare triple {56838#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 117: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 118: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 119: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {56838#true} {56838#true} #78#return; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L272 TraceCheckUtils]: 121: Hoare triple {56838#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 122: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 123: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 124: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {56838#true} {56838#true} #80#return; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L272 TraceCheckUtils]: 126: Hoare triple {56838#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 127: Hoare triple {56838#true} ~cond := #in~cond; {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 128: Hoare triple {56838#true} assume !(0 == ~cond); {56838#true} is VALID [2022-04-15 09:58:29,062 INFO L290 TraceCheckUtils]: 129: Hoare triple {56838#true} assume true; {56838#true} is VALID [2022-04-15 09:58:29,063 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {56838#true} {56838#true} #82#return; {56838#true} is VALID [2022-04-15 09:58:29,063 INFO L290 TraceCheckUtils]: 131: Hoare triple {56838#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56838#true} is VALID [2022-04-15 09:58:29,067 INFO L290 TraceCheckUtils]: 132: Hoare triple {56838#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {57239#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-15 09:58:29,068 INFO L290 TraceCheckUtils]: 133: Hoare triple {57239#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {57243#(<= 51 ~counter~0)} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 134: Hoare triple {57243#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57247#(<= 51 |main_#t~post6|)} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 135: Hoare triple {57247#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L272 TraceCheckUtils]: 136: Hoare triple {56839#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 137: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 138: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 139: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {56839#false} {56839#false} #84#return; {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L272 TraceCheckUtils]: 141: Hoare triple {56839#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,069 INFO L290 TraceCheckUtils]: 142: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 143: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 144: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {56839#false} {56839#false} #86#return; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 146: Hoare triple {56839#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); {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 147: Hoare triple {56839#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 148: Hoare triple {56839#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 149: Hoare triple {56839#false} assume !!(#t~post6 < 50);havoc #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L272 TraceCheckUtils]: 150: Hoare triple {56839#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 151: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 152: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 153: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {56839#false} {56839#false} #84#return; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L272 TraceCheckUtils]: 155: Hoare triple {56839#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 156: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,070 INFO L290 TraceCheckUtils]: 157: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 158: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56839#false} {56839#false} #86#return; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 160: Hoare triple {56839#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); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 161: Hoare triple {56839#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 162: Hoare triple {56839#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 163: Hoare triple {56839#false} assume !!(#t~post6 < 50);havoc #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L272 TraceCheckUtils]: 164: Hoare triple {56839#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 165: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 166: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 167: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {56839#false} {56839#false} #84#return; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L272 TraceCheckUtils]: 169: Hoare triple {56839#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 170: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 171: Hoare triple {56839#false} assume !(0 == ~cond); {56839#false} is VALID [2022-04-15 09:58:29,071 INFO L290 TraceCheckUtils]: 172: Hoare triple {56839#false} assume true; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {56839#false} {56839#false} #86#return; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 174: Hoare triple {56839#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); {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 175: Hoare triple {56839#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 176: Hoare triple {56839#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 177: Hoare triple {56839#false} assume !(#t~post6 < 50);havoc #t~post6; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L272 TraceCheckUtils]: 178: Hoare triple {56839#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 179: Hoare triple {56839#false} ~cond := #in~cond; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 180: Hoare triple {56839#false} assume 0 == ~cond; {56839#false} is VALID [2022-04-15 09:58:29,072 INFO L290 TraceCheckUtils]: 181: Hoare triple {56839#false} assume !false; {56839#false} is VALID [2022-04-15 09:58:29,073 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-15 09:58:29,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:58:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:58:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993362918] [2022-04-15 09:58:29,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:58:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689936315] [2022-04-15 09:58:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689936315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:58:29,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:58:29,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:58:29,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:58:29,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877475350] [2022-04-15 09:58:29,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877475350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:58:29,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:58:29,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:58:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622912] [2022-04-15 09:58:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:58:29,074 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-15 09:58:29,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:58:29,074 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-15 09:58:29,100 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-15 09:58:29,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:58:29,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:29,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:58:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:58:29,101 INFO L87 Difference]: Start difference. First operand 563 states and 627 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 09:58:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:30,053 INFO L93 Difference]: Finished difference Result 650 states and 714 transitions. [2022-04-15 09:58:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:58:30,053 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-15 09:58:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:58:30,054 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-15 09:58:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 09:58:30,054 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-15 09:58:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 09:58:30,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 09:58:30,121 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-15 09:58:30,133 INFO L225 Difference]: With dead ends: 650 [2022-04-15 09:58:30,133 INFO L226 Difference]: Without dead ends: 537 [2022-04-15 09:58:30,134 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:58:30,134 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:58:30,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:58:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-15 09:58:30,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2022-04-15 09:58:30,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:58:30,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-15 09:58:30,949 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-15 09:58:30,949 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-15 09:58:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:30,958 INFO L93 Difference]: Finished difference Result 537 states and 584 transitions. [2022-04-15 09:58:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 584 transitions. [2022-04-15 09:58:30,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:30,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:30,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 537 states. [2022-04-15 09:58:30,965 INFO L87 Difference]: Start difference. First operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 537 states. [2022-04-15 09:58:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:58:30,974 INFO L93 Difference]: Finished difference Result 537 states and 584 transitions. [2022-04-15 09:58:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 584 transitions. [2022-04-15 09:58:30,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:58:30,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:58:30,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:58:30,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:58:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 367 states have (on average 1.0844686648501363) internal successors, (398), 373 states have internal predecessors, (398), 94 states have call successors, (94), 75 states have call predecessors, (94), 73 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-15 09:58:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 583 transitions. [2022-04-15 09:58:30,987 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 583 transitions. Word has length 182 [2022-04-15 09:58:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:58:30,987 INFO L478 AbstractCegarLoop]: Abstraction has 535 states and 583 transitions. [2022-04-15 09:58:30,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 09:58:30,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 535 states and 583 transitions. [2022-04-15 09:58:32,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:58:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 583 transitions. [2022-04-15 09:58:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-15 09:58:32,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:58:32,239 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:58:32,255 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-15 09:58:32,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:58:32,447 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:58:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:58:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 19 times [2022-04-15 09:58:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:58:32,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1366125799]