/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:49:25,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:49:25,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:49:25,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:49:25,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:49:25,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:49:25,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:49:25,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:49:25,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:49:25,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:49:25,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:49:25,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:49:25,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:49:25,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:49:25,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:49:25,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:49:25,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:49:25,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:49:25,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:49:25,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:49:25,909 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:49:25,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:49:25,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:49:25,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:49:25,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:49:25,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:49:25,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:49:25,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:49:25,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:49:25,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:49:25,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:49:25,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:49:25,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:49:25,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:49:25,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:49:25,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:49:25,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:49:25,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:49:25,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:49:25,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:49:25,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:49:25,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:49:25,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:49:25,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:49:25,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:49:25,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:49:25,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:49:25,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:49:25,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:49:25,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:49:25,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:49:25,958 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:49:25,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:49:25,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:49:25,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:49:25,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:49:25,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:49:25,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:49:25,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:49:25,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:49:25,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:49:25,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:49:25,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:49:25,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:49:25,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:49:25,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:49:25,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:49:25,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:49:25,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:49:25,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:49:25,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:49:25,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:49:26,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:49:26,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:49:26,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:49:26,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:49:26,221 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:49:26,222 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-27 13:49:26,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a496c008/517607b44652418db57ce4231726aed1/FLAGa032f840d [2022-04-27 13:49:26,665 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:49:26,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c [2022-04-27 13:49:26,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a496c008/517607b44652418db57ce4231726aed1/FLAGa032f840d [2022-04-27 13:49:27,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a496c008/517607b44652418db57ce4231726aed1 [2022-04-27 13:49:27,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:49:27,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:49:27,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:49:27,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:49:27,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:49:27,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f42090d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27, skipping insertion in model container [2022-04-27 13:49:27,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:49:27,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:49:27,271 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-27 13:49:27,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:49:27,300 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:49:27,312 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-27 13:49:27,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:49:27,329 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:49:27,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27 WrapperNode [2022-04-27 13:49:27,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:49:27,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:49:27,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:49:27,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:49:27,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:49:27,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:49:27,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:49:27,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:49:27,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (1/1) ... [2022-04-27 13:49:27,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:49:27,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:27,397 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-27 13:49:27,413 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-27 13:49:27,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:49:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:49:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:49:27,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:49:27,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:49:27,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:49:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:49:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:49:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:49:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:49:27,506 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:49:27,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:49:27,700 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:49:27,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:49:27,718 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:49:27,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:49:27 BoogieIcfgContainer [2022-04-27 13:49:27,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:49:27,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:49:27,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:49:27,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:49:27,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:49:27" (1/3) ... [2022-04-27 13:49:27,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56beba20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:49:27, skipping insertion in model container [2022-04-27 13:49:27,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:49:27" (2/3) ... [2022-04-27 13:49:27,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56beba20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:49:27, skipping insertion in model container [2022-04-27 13:49:27,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:49:27" (3/3) ... [2022-04-27 13:49:27,731 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound50.c [2022-04-27 13:49:27,744 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:49:27,744 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:49:27,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:49:27,792 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50f72d01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74e41c42 [2022-04-27 13:49:27,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:49:27,806 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-27 13:49:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:49:27,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:27,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:27,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-27 13:49:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:27,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511195637] [2022-04-27 13:49:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:49:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:28,080 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-27 13:49:28,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:49:28,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:49:28,085 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-27 13:49:28,085 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-27 13:49:28,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:49:28,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:49:28,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:49:28,087 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-27 13:49:28,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 13:49:28,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:49:28,089 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-27 13:49:28,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:49:28,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:49:28,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:49:28,090 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-27 13:49:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:28,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511195637] [2022-04-27 13:49:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511195637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:28,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:49:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537510820] [2022-04-27 13:49:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:28,104 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-27 13:49:28,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:28,109 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-27 13:49:28,144 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-27 13:49:28,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:49:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:49:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:49:28,170 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-27 13:49:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:28,414 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-27 13:49:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:49:28,414 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-27 13:49:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:28,416 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-27 13:49:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:49:28,434 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-27 13:49:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:49:28,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-27 13:49:28,570 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-27 13:49:28,578 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:49:28,579 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:49:28,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:49:28,587 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:28,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:49:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 13:49:28,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:28,620 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-27 13:49:28,621 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-27 13:49:28,621 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-27 13:49:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:28,626 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:49:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:49:28,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:28,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:28,628 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-27 13:49:28,628 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:49:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:28,632 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:49:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:49:28,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:28,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:28,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:28,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:28,634 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-27 13:49:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-27 13:49:28,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-27 13:49:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-27 13:49:28,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:49:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-27 13:49:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:49:28,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:28,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:28,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:49:28,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-27 13:49:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78475047] [2022-04-27 13:49:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:49:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:28,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(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; {215#true} is VALID [2022-04-27 13:49:28,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:49:28,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:49:28,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:49:28,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(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; {215#true} is VALID [2022-04-27 13:49:28,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:49:28,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:49:28,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-27 13:49:28,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#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; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:49:28,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:49:28,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} assume !!(#t~post5 < 50);havoc #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:49:28,778 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:28,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:49:28,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-27 13:49:28,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 13:49:28,780 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-27 13:49:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78475047] [2022-04-27 13:49:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78475047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:28,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:49:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509009540] [2022-04-27 13:49:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:28,782 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-27 13:49:28,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:28,783 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-27 13:49:28,794 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-27 13:49:28,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:49:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:49:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:49:28,796 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-27 13:49:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,169 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-27 13:49:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:49:29,171 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-27 13:49:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:29,171 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-27 13:49:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:49:29,185 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-27 13:49:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:49:29,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:49:29,251 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-27 13:49:29,256 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:49:29,256 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 13:49:29,260 INFO L412 NwaCegarLoop]: 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-27 13:49:29,263 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:29,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 13:49:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 13:49:29,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:29,275 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-27 13:49:29,276 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-27 13:49:29,276 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-27 13:49:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,282 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:49:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:49:29,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:29,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:29,290 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-27 13:49:29,292 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-27 13:49:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,298 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:49:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:49:29,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:29,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:29,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:29,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:29,299 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-27 13:49:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 13:49:29,301 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-27 13:49:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:29,301 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 13:49:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:49:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 13:49:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 13:49:29,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:29,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:29,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:49:29,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-27 13:49:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:29,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456089662] [2022-04-27 13:49:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:49:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:29,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(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; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:49:29,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(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; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~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; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:29,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {422#(<= |main_#t~post5| 0)} is VALID [2022-04-27 13:49:29,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {417#false} is VALID [2022-04-27 13:49:29,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {417#false} is VALID [2022-04-27 13:49:29,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 50);havoc #t~post6; {417#false} is VALID [2022-04-27 13:49:29,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {417#false} is VALID [2022-04-27 13:49:29,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 13:49:29,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 13:49:29,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 13:49:29,446 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-27 13:49:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:29,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456089662] [2022-04-27 13:49:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456089662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:29,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:49:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675611441] [2022-04-27 13:49:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:29,447 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-27 13:49:29,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:29,447 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-27 13:49:29,459 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-27 13:49:29,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:49:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:29,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:49:29,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:49:29,461 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-27 13:49:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,685 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-27 13:49:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:49:29,685 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-27 13:49:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:29,685 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-27 13:49:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:49:29,688 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-27 13:49:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:49:29,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-27 13:49:29,749 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-27 13:49:29,750 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:49:29,750 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:49:29,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:49:29,752 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:29,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:49:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:49:29,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:29,760 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-27 13:49:29,760 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-27 13:49:29,760 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-27 13:49:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,762 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:49:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:49:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:29,763 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-27 13:49:29,764 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-27 13:49:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:29,766 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:49:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:49:29,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:29,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:29,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:29,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:29,767 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-27 13:49:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:49:29,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-27 13:49:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:29,769 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:49:29,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:49:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:49:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 13:49:29,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:29,770 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:29,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:49:29,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:29,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:29,770 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-27 13:49:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:29,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843037900] [2022-04-27 13:49:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:49:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:29,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(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; {605#true} is VALID [2022-04-27 13:49:29,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:49:29,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:49:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 13:49:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:29,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:49:29,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:49:29,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:49:29,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:49:29,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:49:29,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(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; {605#true} is VALID [2022-04-27 13:49:29,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:49:29,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:49:29,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-27 13:49:29,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#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; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:49:29,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:49:29,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 50);havoc #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:49:29,842 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:49:29,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:49:29,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:49:29,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:49:29,843 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:49:29,844 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:29,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:49:29,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:49:29,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:49:29,845 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-27 13:49:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:29,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843037900] [2022-04-27 13:49:29,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843037900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:29,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:29,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:49:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558386872] [2022-04-27 13:49:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:29,847 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-27 13:49:29,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:29,847 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-27 13:49:29,862 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-27 13:49:29,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:49:29,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:49:29,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:49:29,864 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-27 13:49:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,186 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:49:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:49:30,186 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-27 13:49:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:30,187 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-27 13:49:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:49:30,189 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-27 13:49:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:49:30,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:49:30,253 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-27 13:49:30,255 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:49:30,256 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:49:30,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:49:30,265 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:30,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:49:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-27 13:49:30,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:30,283 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-27 13:49:30,283 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-27 13:49:30,284 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-27 13:49:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,286 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:49:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:49:30,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:30,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:30,287 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-27 13:49:30,287 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-27 13:49:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,293 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:49:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:49:30,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:30,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:30,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:30,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:30,294 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-27 13:49:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-27 13:49:30,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-27 13:49:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:30,297 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-27 13:49:30,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:49:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-27 13:49:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:49:30,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:30,297 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:30,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:49:30,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-27 13:49:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:30,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807496574] [2022-04-27 13:49:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:30,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454044808] [2022-04-27 13:49:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:30,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:30,328 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-27 13:49:30,355 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-27 13:49:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:30,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:49:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:30,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:30,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-27 13:49:30,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#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; {834#true} is VALID [2022-04-27 13:49:30,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:49:30,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-27 13:49:30,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-27 13:49:30,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#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; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:30,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:30,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:30,642 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(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)); {834#true} is VALID [2022-04-27 13:49:30,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:49:30,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:49:30,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:49:30,643 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:30,643 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(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)); {834#true} is VALID [2022-04-27 13:49:30,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:49:30,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:49:30,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:49:30,644 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:30,645 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(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)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:30,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:30,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-27 13:49:30,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-27 13:49:30,646 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-27 13:49:30,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:49:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807496574] [2022-04-27 13:49:30,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454044808] [2022-04-27 13:49:30,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454044808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:30,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:30,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:49:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443417329] [2022-04-27 13:49:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:30,648 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-27 13:49:30,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:30,648 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-27 13:49:30,663 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-27 13:49:30,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:49:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:30,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:49:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:49:30,665 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-27 13:49:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,861 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 13:49:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:49:30,861 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-27 13:49:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:30,861 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-27 13:49:30,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:49:30,866 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-27 13:49:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:49:30,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 13:49:30,934 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-27 13:49:30,936 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:49:30,936 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:49:30,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:49:30,938 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:30,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:49:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:49:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 13:49:30,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:30,949 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-27 13:49:30,954 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-27 13:49:30,955 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-27 13:49:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,958 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:49:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:49:30,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:30,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:30,960 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-27 13:49:30,960 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-27 13:49:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:30,965 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:49:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:49:30,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:30,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:30,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:30,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:30,966 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-27 13:49:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:49:30,970 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-27 13:49:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:30,970 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:49:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:49:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:49:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:49:30,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:30,976 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:31,006 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-27 13:49:31,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:31,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-27 13:49:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:31,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273509250] [2022-04-27 13:49:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:31,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:31,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453654132] [2022-04-27 13:49:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:31,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:31,217 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-27 13:49:31,220 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-27 13:49:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:31,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:49:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:31,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:31,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 13:49:31,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#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; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:31,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:31,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:31,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:31,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#(<= ~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; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:31,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,501 INFO L272 TraceCheckUtils]: 8: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,504 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #78#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,505 INFO L272 TraceCheckUtils]: 13: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,506 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #80#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,507 INFO L272 TraceCheckUtils]: 18: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #82#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:31,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {1197#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:49:31,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1174#false} is VALID [2022-04-27 13:49:31,521 INFO L272 TraceCheckUtils]: 26: Hoare triple {1174#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1174#false} is VALID [2022-04-27 13:49:31,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 13:49:31,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 13:49:31,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 13:49:31,522 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-27 13:49:31,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:49:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:31,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273509250] [2022-04-27 13:49:31,523 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:31,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453654132] [2022-04-27 13:49:31,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453654132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:31,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:31,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:49:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621925553] [2022-04-27 13:49:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:31,524 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-27 13:49:31,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:31,524 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-27 13:49:31,542 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-27 13:49:31,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:49:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:49:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:49:31,544 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-27 13:49:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:31,657 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 13:49:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:49:31,657 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-27 13:49:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:31,657 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-27 13:49:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:49:31,659 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-27 13:49:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:49:31,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:49:31,703 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-27 13:49:31,704 INFO L225 Difference]: With dead ends: 70 [2022-04-27 13:49:31,704 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:49:31,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:49:31,705 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:31,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:49:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:49:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:49:31,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:31,720 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-27 13:49:31,720 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-27 13:49:31,720 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-27 13:49:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:31,723 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:49:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:49:31,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:31,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:31,723 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-27 13:49:31,724 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-27 13:49:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:31,726 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:49:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:49:31,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:31,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:31,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:31,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:31,727 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-27 13:49:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 13:49:31,729 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-27 13:49:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:31,729 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 13:49:31,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:49:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 13:49:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:49:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:31,730 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:31,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:49:31,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 13:49:31,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-27 13:49:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:31,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231545073] [2022-04-27 13:49:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:31,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252616716] [2022-04-27 13:49:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:31,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:31,960 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-27 13:49:31,961 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-27 13:49:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:32,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:49:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:32,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:34,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-27 13:49:34,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#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; {1580#true} is VALID [2022-04-27 13:49:34,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:49:34,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-27 13:49:34,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-27 13:49:34,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#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; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,527 INFO L272 TraceCheckUtils]: 8: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:49:34,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:49:34,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:49:34,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:49:34,528 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,528 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:49:34,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:49:34,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:49:34,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:49:34,529 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,529 INFO L272 TraceCheckUtils]: 18: Hoare triple {1600#(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)); {1580#true} is VALID [2022-04-27 13:49:34,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:49:34,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:49:34,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:49:34,530 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:49:34,532 INFO L272 TraceCheckUtils]: 26: Hoare triple {1600#(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)); {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:34,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:34,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-27 13:49:34,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-27 13:49:34,533 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-27 13:49:34,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:49:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:34,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231545073] [2022-04-27 13:49:34,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:34,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252616716] [2022-04-27 13:49:34,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252616716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:49:34,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:49:34,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:49:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508875620] [2022-04-27 13:49:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:34,535 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-27 13:49:34,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:34,535 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-27 13:49:34,557 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-27 13:49:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:49:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:49:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:49:34,559 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-27 13:49:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:34,754 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 13:49:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:49:34,754 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-27 13:49:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:34,756 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-27 13:49:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:49:34,757 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-27 13:49:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:49:34,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 13:49:34,808 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-27 13:49:34,811 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:49:34,811 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:49:34,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:49:34,813 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:34,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:49:34,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:49:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 13:49:34,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:34,841 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-27 13:49:34,841 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-27 13:49:34,841 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-27 13:49:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:34,845 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:49:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:49:34,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:34,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:34,846 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-27 13:49:34,846 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-27 13:49:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:34,849 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:49:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:49:34,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:34,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:34,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:34,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:34,851 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-27 13:49:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 13:49:34,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-27 13:49:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:34,853 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 13:49:34,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:49:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:49:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:49:34,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:34,856 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:34,883 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-27 13:49:35,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:35,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-27 13:49:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:35,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128022914] [2022-04-27 13:49:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:35,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:35,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096718379] [2022-04-27 13:49:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:35,101 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-27 13:49:35,119 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-27 13:49:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:35,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:49:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:35,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:35,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:49:35,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:35,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:35,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:35,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:35,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~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; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:35,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,342 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,342 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,343 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,344 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,346 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:35,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-27 13:49:35,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:49:35,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:49:35,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 50);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:49:35,347 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:49:35,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:49:35,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:49:35,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:49:35,348 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-27 13:49:35,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:49:35,563 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:49:35,563 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:49:35,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:49:35,567 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:49:35,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 50);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:49:35,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:49:35,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:49:35,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2149#(< |main_#t~post5| 50)} is VALID [2022-04-27 13:49:35,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {2153#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,570 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2153#(< ~counter~0 50)} #82#return; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:49:35,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:49:35,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:49:35,571 INFO L272 TraceCheckUtils]: 18: Hoare triple {2153#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:49:35,571 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2153#(< ~counter~0 50)} #80#return; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:49:35,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:49:35,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:49:35,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {2153#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:49:35,572 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2153#(< ~counter~0 50)} #78#return; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:49:35,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:49:35,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:49:35,573 INFO L272 TraceCheckUtils]: 8: Hoare triple {2153#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:49:35,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2153#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {2208#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2153#(< ~counter~0 50)} is VALID [2022-04-27 13:49:35,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#(< ~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; {2208#(< ~counter~0 49)} is VALID [2022-04-27 13:49:35,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#(< ~counter~0 49)} call #t~ret7 := main(); {2208#(< ~counter~0 49)} is VALID [2022-04-27 13:49:35,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#(< ~counter~0 49)} {2000#true} #92#return; {2208#(< ~counter~0 49)} is VALID [2022-04-27 13:49:35,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< ~counter~0 49)} assume true; {2208#(< ~counter~0 49)} is VALID [2022-04-27 13:49:35,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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; {2208#(< ~counter~0 49)} is VALID [2022-04-27 13:49:35,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:49:35,578 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-27 13:49:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128022914] [2022-04-27 13:49:35,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096718379] [2022-04-27 13:49:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096718379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:49:35,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:49:35,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:49:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814114917] [2022-04-27 13:49:35,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:49:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:49:35,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:35,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:49:35,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:49:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:49:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:49:35,625 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:49:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:35,911 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2022-04-27 13:49:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:49:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-04-27 13:49:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:49:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:49:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:49:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:49:35,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:49:36,017 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-27 13:49:36,020 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:49:36,020 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:49:36,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:49:36,025 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:36,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:49:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-27 13:49:36,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:36,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:49:36,074 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:49:36,076 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:49:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:36,082 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:49:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:49:36,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:36,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:36,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:49:36,083 INFO L87 Difference]: Start difference. First operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 119 states. [2022-04-27 13:49:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:36,089 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:49:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:49:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:36,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:36,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:36,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 13:49:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-27 13:49:36,095 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 37 [2022-04-27 13:49:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:36,095 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-27 13:49:36,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-27 13:49:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 13:49:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:49:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:36,096 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:36,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:49:36,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:36,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-27 13:49:36,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:36,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216295701] [2022-04-27 13:49:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:36,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:36,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094825545] [2022-04-27 13:49:36,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:36,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:36,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:36,334 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-27 13:49:36,362 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-27 13:49:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:36,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:49:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:36,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:36,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:49:36,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#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; {2830#true} is VALID [2022-04-27 13:49:36,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:49:36,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:49:36,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#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; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,610 INFO L272 TraceCheckUtils]: 8: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:49:36,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,610 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,610 INFO L272 TraceCheckUtils]: 13: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:49:36,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,611 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,611 INFO L272 TraceCheckUtils]: 18: Hoare triple {2850#(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)); {2830#true} is VALID [2022-04-27 13:49:36,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,612 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {2850#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:36,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {2850#(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; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:49:36,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#(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; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:49:36,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:49:36,614 INFO L272 TraceCheckUtils]: 26: Hoare triple {2905#(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)); {2830#true} is VALID [2022-04-27 13:49:36,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,615 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:49:36,615 INFO L272 TraceCheckUtils]: 31: Hoare triple {2905#(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)); {2830#true} is VALID [2022-04-27 13:49:36,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,616 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {2905#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:49:36,617 INFO L272 TraceCheckUtils]: 36: Hoare triple {2905#(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)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:36,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:36,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:49:36,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:49:36,618 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-27 13:49:36,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:49:36,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:49:36,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:49:36,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:36,885 INFO L272 TraceCheckUtils]: 36: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:36,885 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,885 INFO L272 TraceCheckUtils]: 31: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:49:36,886 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,886 INFO L272 TraceCheckUtils]: 26: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:49:36,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,892 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,892 INFO L272 TraceCheckUtils]: 18: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:49:36,893 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:49:36,893 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2830#true} {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:49:36,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:49:36,894 INFO L272 TraceCheckUtils]: 8: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2830#true} is VALID [2022-04-27 13:49:36,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2830#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; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:49:36,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:49:36,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:49:36,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:49:36,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {2830#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; {2830#true} is VALID [2022-04-27 13:49:36,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:49:36,896 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-27 13:49:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216295701] [2022-04-27 13:49:36,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094825545] [2022-04-27 13:49:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094825545] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:49:36,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:49:36,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:49:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406633119] [2022-04-27 13:49:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:49:36,897 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-27 13:49:36,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:36,897 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-27 13:49:36,915 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-27 13:49:36,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:49:36,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:49:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:49:36,916 INFO L87 Difference]: Start difference. First operand 112 states and 133 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-27 13:49:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:39,252 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-04-27 13:49:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:49:39,253 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-27 13:49:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:39,253 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-27 13:49:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:49:39,255 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-27 13:49:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:49:39,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:49:39,330 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-27 13:49:39,333 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:49:39,333 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 13:49:39,333 INFO L412 NwaCegarLoop]: 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-27 13:49:39,334 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:39,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 13:49:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-04-27 13:49:39,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:39,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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-27 13:49:39,369 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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-27 13:49:39,369 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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-27 13:49:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:39,374 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:49:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:49:39,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:39,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:39,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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 125 states. [2022-04-27 13:49:39,375 INFO L87 Difference]: Start difference. First operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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 125 states. [2022-04-27 13:49:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:39,379 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:49:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:49:39,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:39,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:39,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:39,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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-27 13:49:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-04-27 13:49:39,384 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 40 [2022-04-27 13:49:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:39,385 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-04-27 13:49:39,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:49:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-04-27 13:49:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 13:49:39,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:39,386 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:39,415 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-27 13:49:39,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:39,600 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-27 13:49:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:39,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424091255] [2022-04-27 13:49:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:39,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:39,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798506283] [2022-04-27 13:49:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:39,628 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-27 13:49:39,630 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-27 13:49:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:39,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:49:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:39,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:39,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:49:39,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#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; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:39,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#(<= ~counter~0 0)} assume true; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:39,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#(<= ~counter~0 0)} {3681#true} #92#return; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:39,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#(<= ~counter~0 0)} call #t~ret7 := main(); {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:39,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3689#(<= ~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; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:49:39,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,946 INFO L272 TraceCheckUtils]: 8: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,947 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #78#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,947 INFO L272 TraceCheckUtils]: 13: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,949 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #80#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,949 INFO L272 TraceCheckUtils]: 18: Hoare triple {3705#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,954 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3705#(<= ~counter~0 1)} {3705#(<= ~counter~0 1)} #82#return; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {3705#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:49:39,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {3705#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,956 INFO L272 TraceCheckUtils]: 26: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,957 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #78#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,958 INFO L272 TraceCheckUtils]: 31: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,959 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #80#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,959 INFO L272 TraceCheckUtils]: 36: Hoare triple {3760#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,961 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3760#(<= ~counter~0 2)} {3760#(<= ~counter~0 2)} #82#return; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:49:39,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3815#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:49:39,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {3682#false} assume true; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3682#false} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:49:39,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:49:39,964 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-27 13:49:39,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:49:40,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:49:40,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:49:40,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:49:40,225 INFO L272 TraceCheckUtils]: 49: Hoare triple {3682#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3682#false} is VALID [2022-04-27 13:49:40,225 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3681#true} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:49:40,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,225 INFO L272 TraceCheckUtils]: 44: Hoare triple {3682#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {3873#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:49:40,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {3877#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3873#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:49:40,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {3877#(< ~counter~0 50)} assume !(~r~0 >= ~d~0); {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,227 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3681#true} {3877#(< ~counter~0 50)} #82#return; {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,228 INFO L272 TraceCheckUtils]: 36: Hoare triple {3877#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,228 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3681#true} {3877#(< ~counter~0 50)} #80#return; {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L272 TraceCheckUtils]: 31: Hoare triple {3877#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3681#true} {3877#(< ~counter~0 50)} #78#return; {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,229 INFO L272 TraceCheckUtils]: 26: Hoare triple {3877#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {3877#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {3932#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3877#(< ~counter~0 50)} is VALID [2022-04-27 13:49:40,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {3932#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,231 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3681#true} {3932#(< ~counter~0 49)} #82#return; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,232 INFO L272 TraceCheckUtils]: 18: Hoare triple {3932#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,232 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3681#true} {3932#(< ~counter~0 49)} #80#return; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L272 TraceCheckUtils]: 13: Hoare triple {3932#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3681#true} {3932#(< ~counter~0 49)} #78#return; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:49:40,233 INFO L272 TraceCheckUtils]: 8: Hoare triple {3932#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:49:40,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {3932#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {3987#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3932#(< ~counter~0 49)} is VALID [2022-04-27 13:49:40,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {3987#(< ~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; {3987#(< ~counter~0 48)} is VALID [2022-04-27 13:49:40,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#(< ~counter~0 48)} call #t~ret7 := main(); {3987#(< ~counter~0 48)} is VALID [2022-04-27 13:49:40,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#(< ~counter~0 48)} {3681#true} #92#return; {3987#(< ~counter~0 48)} is VALID [2022-04-27 13:49:40,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#(< ~counter~0 48)} assume true; {3987#(< ~counter~0 48)} is VALID [2022-04-27 13:49:40,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {3681#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; {3987#(< ~counter~0 48)} is VALID [2022-04-27 13:49:40,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:49:40,237 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-27 13:49:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424091255] [2022-04-27 13:49:40,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798506283] [2022-04-27 13:49:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798506283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:49:40,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:49:40,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:49:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779974931] [2022-04-27 13:49:40,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:49:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:49:40,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:40,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:49:40,293 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-27 13:49:40,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:49:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:40,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:49:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:49:40,295 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:49:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:40,878 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-04-27 13:49:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:49:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 53 [2022-04-27 13:49:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:49:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:49:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:49:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:49:40,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-27 13:49:41,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:41,027 INFO L225 Difference]: With dead ends: 245 [2022-04-27 13:49:41,027 INFO L226 Difference]: Without dead ends: 224 [2022-04-27 13:49:41,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:49:41,028 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:41,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 222 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:49:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-27 13:49:41,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 217. [2022-04-27 13:49:41,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:41,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:49:41,100 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:49:41,100 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:49:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:41,107 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:49:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:49:41,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:41,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:41,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) Second operand 224 states. [2022-04-27 13:49:41,109 INFO L87 Difference]: Start difference. First operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) Second operand 224 states. [2022-04-27 13:49:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:41,116 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:49:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:49:41,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:41,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:41,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:41,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 51 states have call successors, (51), 28 states have call predecessors, (51), 26 states have return successors, (46), 40 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-27 13:49:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2022-04-27 13:49:41,124 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 53 [2022-04-27 13:49:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:41,124 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2022-04-27 13:49:41,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 8 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-27 13:49:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2022-04-27 13:49:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 13:49:41,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:41,125 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:41,151 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-27 13:49:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:41,340 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-27 13:49:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367826078] [2022-04-27 13:49:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:41,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:41,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139864073] [2022-04-27 13:49:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:41,353 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-27 13:49:41,361 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-27 13:49:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:41,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:49:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:41,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:41,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:49:41,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {5104#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; {5104#true} is VALID [2022-04-27 13:49:41,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:49:41,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:49:41,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {5104#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; {5124#(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-27 13:49:41,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {5124#(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; {5124#(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-27 13:49:41,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {5124#(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; {5124#(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-27 13:49:41,980 INFO L272 TraceCheckUtils]: 8: Hoare triple {5124#(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)); {5104#true} is VALID [2022-04-27 13:49:41,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,981 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5104#true} {5124#(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; {5124#(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-27 13:49:41,981 INFO L272 TraceCheckUtils]: 13: Hoare triple {5124#(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)); {5104#true} is VALID [2022-04-27 13:49:41,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,982 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5104#true} {5124#(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; {5124#(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-27 13:49:41,982 INFO L272 TraceCheckUtils]: 18: Hoare triple {5124#(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)); {5104#true} is VALID [2022-04-27 13:49:41,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,983 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5104#true} {5124#(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; {5124#(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-27 13:49:41,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {5124#(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; {5179#(and (= main_~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-27 13:49:41,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,985 INFO L272 TraceCheckUtils]: 26: Hoare triple {5179#(and (= main_~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)); {5104#true} is VALID [2022-04-27 13:49:41,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,986 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5104#true} {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,986 INFO L272 TraceCheckUtils]: 31: Hoare triple {5179#(and (= main_~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)); {5104#true} is VALID [2022-04-27 13:49:41,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,987 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5104#true} {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,987 INFO L272 TraceCheckUtils]: 36: Hoare triple {5179#(and (= main_~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)); {5104#true} is VALID [2022-04-27 13:49:41,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,987 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5104#true} {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {5179#(and (= main_~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); {5179#(and (= main_~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-27 13:49:41,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,989 INFO L272 TraceCheckUtils]: 44: Hoare triple {5179#(and (= main_~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)); {5104#true} is VALID [2022-04-27 13:49:41,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,990 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5104#true} {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,990 INFO L272 TraceCheckUtils]: 49: Hoare triple {5179#(and (= main_~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)); {5104#true} is VALID [2022-04-27 13:49:41,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:41,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:41,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:41,991 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5104#true} {5179#(and (= main_~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; {5179#(and (= main_~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-27 13:49:41,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {5179#(and (= main_~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); {5124#(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-27 13:49:41,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {5124#(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; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:49:41,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {5276#(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; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:49:41,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {5276#(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; {5276#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:49:41,994 INFO L272 TraceCheckUtils]: 58: Hoare triple {5276#(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)); {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:41,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:41,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:49:41,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:49:41,995 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-27 13:49:41,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:49:43,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:49:43,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:49:43,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5290#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:43,567 INFO L272 TraceCheckUtils]: 58: Hoare triple {5306#(= (+ (* 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)); {5286#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:43,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:49:43,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:49:43,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {5316#(= 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; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:49:43,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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); {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,603 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,604 INFO L272 TraceCheckUtils]: 49: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)); {5104#true} is VALID [2022-04-27 13:49:43,605 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,605 INFO L272 TraceCheckUtils]: 44: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)); {5104#true} is VALID [2022-04-27 13:49:43,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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); {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,609 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,610 INFO L272 TraceCheckUtils]: 36: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)); {5104#true} is VALID [2022-04-27 13:49:43,610 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,611 INFO L272 TraceCheckUtils]: 31: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)); {5104#true} is VALID [2022-04-27 13:49:43,620 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5104#true} {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,620 INFO L272 TraceCheckUtils]: 26: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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)); {5104#true} is VALID [2022-04-27 13:49:43,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {5316#(= 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; {5320#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 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-27 13:49:43,634 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {5316#(= 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)); {5104#true} is VALID [2022-04-27 13:49:43,635 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,635 INFO L272 TraceCheckUtils]: 13: Hoare triple {5316#(= 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)); {5104#true} is VALID [2022-04-27 13:49:43,635 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5104#true} {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:49:43,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:49:43,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {5316#(= 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)); {5104#true} is VALID [2022-04-27 13:49:43,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {5316#(= 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; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {5316#(= 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; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {5104#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; {5316#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:49:43,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:49:43,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:49:43,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:49:43,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5104#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; {5104#true} is VALID [2022-04-27 13:49:43,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:49:43,638 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-27 13:49:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:49:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367826078] [2022-04-27 13:49:43,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:49:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139864073] [2022-04-27 13:49:43,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139864073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:49:43,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:49:43,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:49:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291490979] [2022-04-27 13:49:43,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:49:43,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:49:43,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:49:43,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:49:43,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:49:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:49:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:49:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:49:43,752 INFO L87 Difference]: Start difference. First operand 217 states and 263 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:49:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:47,367 INFO L93 Difference]: Finished difference Result 371 states and 479 transitions. [2022-04-27 13:49:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:49:47,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 62 [2022-04-27 13:49:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:49:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:49:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:49:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:49:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:49:47,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2022-04-27 13:49:47,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:49:47,592 INFO L225 Difference]: With dead ends: 371 [2022-04-27 13:49:47,592 INFO L226 Difference]: Without dead ends: 303 [2022-04-27 13:49:47,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:49:47,593 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:49:47,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 204 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:49:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-27 13:49:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2022-04-27 13:49:47,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:49:47,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:49:47,702 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:49:47,703 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:49:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:47,712 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:49:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:49:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:47,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 303 states. [2022-04-27 13:49:47,714 INFO L87 Difference]: Start difference. First operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 303 states. [2022-04-27 13:49:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:49:47,723 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:49:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:49:47,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:49:47,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:49:47,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:49:47,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:49:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 191 states have internal predecessors, (228), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:49:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2022-04-27 13:49:47,733 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 62 [2022-04-27 13:49:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:49:47,733 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2022-04-27 13:49:47,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 7 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 13:49:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2022-04-27 13:49:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:49:47,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:49:47,734 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:49:47,759 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-27 13:49:47,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:47,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:49:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:49:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-27 13:49:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:49:47,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408901800] [2022-04-27 13:49:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:49:47,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:49:47,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708215135] [2022-04-27 13:49:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:49:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:49:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:49:47,965 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-27 13:49:47,996 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-27 13:49:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:48,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:49:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:49:48,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:49:48,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:49:48,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {6981#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; {6981#true} is VALID [2022-04-27 13:49:48,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:49:48,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:49:48,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {6981#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; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,867 INFO L272 TraceCheckUtils]: 8: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~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)); {6981#true} is VALID [2022-04-27 13:49:48,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,868 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,868 INFO L272 TraceCheckUtils]: 13: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~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)); {6981#true} is VALID [2022-04-27 13:49:48,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,869 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,869 INFO L272 TraceCheckUtils]: 18: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~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)); {6981#true} is VALID [2022-04-27 13:49:48,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,870 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~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; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,872 INFO L272 TraceCheckUtils]: 26: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:49:48,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,873 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #78#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,873 INFO L272 TraceCheckUtils]: 31: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:49:48,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,874 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #80#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,874 INFO L272 TraceCheckUtils]: 36: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:49:48,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,875 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #82#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,877 INFO L272 TraceCheckUtils]: 44: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:49:48,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,878 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #84#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,878 INFO L272 TraceCheckUtils]: 49: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:49:48,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:49:48,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:49:48,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:49:48,879 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #86#return; {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-27 13:49:48,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {7056#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~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); {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {7001#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~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; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:49:48,883 INFO L272 TraceCheckUtils]: 58: Hoare triple {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= 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)); {6981#true} is VALID [2022-04-27 13:49:48,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:48,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:48,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:48,885 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7153#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {7177#(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-27 13:49:48,885 INFO L272 TraceCheckUtils]: 63: Hoare triple {7177#(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)); {6981#true} is VALID [2022-04-27 13:49:48,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {6981#true} ~cond := #in~cond; {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:48,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {7166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:48,886 INFO L290 TraceCheckUtils]: 66: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:49:48,888 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7177#(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; {7193#(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-27 13:49:48,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {7193#(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); {7197#(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-27 13:49:48,889 INFO L272 TraceCheckUtils]: 69: Hoare triple {7197#(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)); {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:49:48,889 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:49:48,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:49:48,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:49:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-27 13:49:48,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:50:02,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:50:02,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:50:02,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:50:02,717 INFO L272 TraceCheckUtils]: 69: Hoare triple {7221#(= (+ (* 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)); {7201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:50:02,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {7225#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {7221#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:50:02,718 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {7229#(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; {7225#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-27 13:50:02,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:50:02,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:50:02,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {6981#true} ~cond := #in~cond; {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:50:02,720 INFO L272 TraceCheckUtils]: 63: Hoare triple {7229#(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)); {6981#true} is VALID [2022-04-27 13:50:02,722 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} {6981#true} #84#return; {7229#(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-27 13:50:02,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:50:02,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:50:02,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {6981#true} ~cond := #in~cond; {7239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:50:02,724 INFO L272 TraceCheckUtils]: 58: Hoare triple {6981#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {6981#true} assume !!(#t~post6 < 50);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:50:02,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-27 13:50:02,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {6981#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6981#true} is VALID [2022-04-27 13:50:02,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {6981#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); {6981#true} is VALID [2022-04-27 13:50:02,724 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {6981#true} #86#return; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L272 TraceCheckUtils]: 49: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {6981#true} #84#return; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L272 TraceCheckUtils]: 44: Hoare triple {6981#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {6981#true} assume !!(#t~post6 < 50);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {6981#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {6981#true} assume !(~r~0 >= ~d~0); {6981#true} is VALID [2022-04-27 13:50:02,725 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L272 TraceCheckUtils]: 36: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L272 TraceCheckUtils]: 31: Hoare triple {6981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:50:02,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L272 TraceCheckUtils]: 26: Hoare triple {6981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {6981#true} assume !!(#t~post5 < 50);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {6981#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L272 TraceCheckUtils]: 18: Hoare triple {6981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,727 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {6981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L272 TraceCheckUtils]: 8: Hoare triple {6981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#true} assume !!(#t~post5 < 50);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6981#true} is VALID [2022-04-27 13:50:02,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {6981#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; {6981#true} is VALID [2022-04-27 13:50:02,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:50:02,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:50:02,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:50:02,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {6981#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; {6981#true} is VALID [2022-04-27 13:50:02,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:50:02,729 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-27 13:50:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:50:02,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408901800] [2022-04-27 13:50:02,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:50:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708215135] [2022-04-27 13:50:02,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708215135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:50:02,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:50:02,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-27 13:50:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163653918] [2022-04-27 13:50:02,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:50:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:50:02,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:50:02,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:50:02,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:50:02,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:50:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:50:02,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:50:02,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:50:02,806 INFO L87 Difference]: Start difference. First operand 274 states and 341 transitions. Second operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:50:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:04,246 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2022-04-27 13:50:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:50:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 73 [2022-04-27 13:50:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:50:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:50:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:50:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:50:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:50:04,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-27 13:50:04,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:50:04,386 INFO L225 Difference]: With dead ends: 335 [2022-04-27 13:50:04,387 INFO L226 Difference]: Without dead ends: 239 [2022-04-27 13:50:04,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:50:04,388 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:50:04,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 167 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:50:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-27 13:50:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2022-04-27 13:50:04,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:50:04,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:50:04,472 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:50:04,473 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:50:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:04,479 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:50:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:50:04,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:50:04,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:50:04,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 239 states. [2022-04-27 13:50:04,481 INFO L87 Difference]: Start difference. First operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) Second operand 239 states. [2022-04-27 13:50:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:04,488 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:50:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:50:04,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:50:04,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:50:04,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:50:04,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:50:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 154 states have internal predecessors, (179), 45 states have call successors, (45), 29 states have call predecessors, (45), 27 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:50:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2022-04-27 13:50:04,495 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 73 [2022-04-27 13:50:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:50:04,496 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2022-04-27 13:50:04,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:50:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2022-04-27 13:50:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:50:04,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:50:04,497 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:50:04,524 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-27 13:50:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:50:04,722 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:50:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:50:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1894150768, now seen corresponding path program 1 times [2022-04-27 13:50:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:50:04,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607792128] [2022-04-27 13:50:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:50:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:50:04,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:50:04,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118323419] [2022-04-27 13:50:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:50:04,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:50:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:50:04,740 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-27 13:50:04,775 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-27 13:50:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:50:04,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:50:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:50:04,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:50:06,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2022-04-27 13:50:06,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {8676#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; {8676#true} is VALID [2022-04-27 13:50:06,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #92#return; {8676#true} is VALID [2022-04-27 13:50:06,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret7 := main(); {8676#true} is VALID [2022-04-27 13:50:06,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {8676#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; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {8696#(<= 1 main_~p~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {8696#(<= 1 main_~p~0)} assume !!(#t~post5 < 50);havoc #t~post5; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,107 INFO L272 TraceCheckUtils]: 8: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,108 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #78#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,108 INFO L272 TraceCheckUtils]: 13: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,108 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #80#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,108 INFO L272 TraceCheckUtils]: 18: Hoare triple {8696#(<= 1 main_~p~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,109 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8676#true} {8696#(<= 1 main_~p~0)} #82#return; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:50:06,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {8696#(<= 1 main_~p~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {8751#(<= 1 (div main_~p~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {8751#(<= 1 (div main_~p~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,111 INFO L272 TraceCheckUtils]: 26: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,112 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #78#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,112 INFO L272 TraceCheckUtils]: 31: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,113 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #80#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,113 INFO L272 TraceCheckUtils]: 36: Hoare triple {8751#(<= 1 (div main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,113 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8676#true} {8751#(<= 1 (div main_~p~0 2))} #82#return; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:50:06,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {8751#(<= 1 (div main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,115 INFO L272 TraceCheckUtils]: 44: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,116 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #78#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,116 INFO L272 TraceCheckUtils]: 49: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,117 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #80#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,137 INFO L272 TraceCheckUtils]: 54: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,138 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #82#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !(~r~0 >= ~d~0); {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 50);havoc #t~post6; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,139 INFO L272 TraceCheckUtils]: 62: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,140 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #84#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,140 INFO L272 TraceCheckUtils]: 67: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8676#true} is VALID [2022-04-27 13:50:06,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:50:06,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:50:06,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:50:06,141 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8676#true} {8806#(<= 1 (div (div main_~p~0 2) 2))} #86#return; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:50:06,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !(1 != ~p~0); {8677#false} is VALID [2022-04-27 13:50:06,141 INFO L272 TraceCheckUtils]: 73: Hoare triple {8677#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {8677#false} is VALID [2022-04-27 13:50:06,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:50:06,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {8677#false} assume !(0 == ~cond); {8677#false} is VALID [2022-04-27 13:50:06,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {8677#false} assume true; {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8677#false} {8677#false} #88#return; {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L272 TraceCheckUtils]: 78: Hoare triple {8677#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2022-04-27 13:50:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-27 13:50:06,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:50:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:50:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607792128] [2022-04-27 13:50:06,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:50:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118323419] [2022-04-27 13:50:06,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118323419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:50:06,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:50:06,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:50:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381266093] [2022-04-27 13:50:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:50:06,144 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), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-27 13:50:06,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:50:06,144 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), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:50:06,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:50:06,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:50:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:50:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:50:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:50:06,192 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:50:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:06,497 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2022-04-27 13:50:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:50:06,498 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), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-27 13:50:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:50:06,498 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), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:50:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:50:06,500 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), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:50:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:50:06,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-04-27 13:50:06,569 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-27 13:50:06,574 INFO L225 Difference]: With dead ends: 242 [2022-04-27 13:50:06,574 INFO L226 Difference]: Without dead ends: 222 [2022-04-27 13:50:06,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:50:06,575 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:50:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:50:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-27 13:50:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2022-04-27 13:50:06,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:50:06,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:50:06,674 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:50:06,674 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:50:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:06,680 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:50:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:50:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:50:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:50:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-27 13:50:06,682 INFO L87 Difference]: Start difference. First operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 222 states. [2022-04-27 13:50:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:50:06,687 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:50:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:50:06,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:50:06,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:50:06,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:50:06,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:50:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 43 states have call successors, (43), 27 states have call predecessors, (43), 26 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:50:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2022-04-27 13:50:06,694 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 82 [2022-04-27 13:50:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:50:06,695 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2022-04-27 13:50:06,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 13:50:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2022-04-27 13:50:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:50:06,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:50:06,696 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:50:06,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:50:06,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:50:06,922 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:50:06,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:50:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 2 times [2022-04-27 13:50:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:50:06,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545572280] [2022-04-27 13:50:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:50:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:50:06,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:50:06,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384513379] [2022-04-27 13:50:06,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:50:06,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:50:06,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:50:06,948 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-27 13:50:06,976 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-27 13:50:07,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:50:07,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:50:07,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 13:50:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:50:07,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:50:07,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:50:07,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {9994#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; {9994#true} is VALID [2022-04-27 13:50:07,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:50:07,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:50:07,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {9994#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; {10014#(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-27 13:50:07,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {10014#(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; {10014#(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-27 13:50:07,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(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; {10014#(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-27 13:50:07,867 INFO L272 TraceCheckUtils]: 8: Hoare triple {10014#(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)); {9994#true} is VALID [2022-04-27 13:50:07,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,868 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9994#true} {10014#(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; {10014#(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-27 13:50:07,868 INFO L272 TraceCheckUtils]: 13: Hoare triple {10014#(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)); {9994#true} is VALID [2022-04-27 13:50:07,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,870 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9994#true} {10014#(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; {10014#(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-27 13:50:07,870 INFO L272 TraceCheckUtils]: 18: Hoare triple {10014#(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)); {9994#true} is VALID [2022-04-27 13:50:07,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,871 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9994#true} {10014#(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; {10014#(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-27 13:50:07,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {10014#(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; {10069#(and (= main_~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-27 13:50:07,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {10069#(and (= main_~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; {10069#(and (= main_~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-27 13:50:07,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {10069#(and (= main_~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; {10069#(and (= main_~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-27 13:50:07,873 INFO L272 TraceCheckUtils]: 26: Hoare triple {10069#(and (= main_~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)); {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9994#true} {10069#(and (= main_~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; {10069#(and (= main_~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-27 13:50:07,873 INFO L272 TraceCheckUtils]: 31: Hoare triple {10069#(and (= main_~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)); {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,874 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9994#true} {10069#(and (= main_~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; {10069#(and (= main_~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-27 13:50:07,874 INFO L272 TraceCheckUtils]: 36: Hoare triple {10069#(and (= main_~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)); {9994#true} is VALID [2022-04-27 13:50:07,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,875 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9994#true} {10069#(and (= main_~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; {10069#(and (= main_~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-27 13:50:07,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {10069#(and (= main_~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; {10124#(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-27 13:50:07,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {10124#(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; {10124#(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-27 13:50:07,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#(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; {10124#(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-27 13:50:07,877 INFO L272 TraceCheckUtils]: 44: Hoare triple {10124#(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)); {9994#true} is VALID [2022-04-27 13:50:07,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,878 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9994#true} {10124#(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; {10124#(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-27 13:50:07,878 INFO L272 TraceCheckUtils]: 49: Hoare triple {10124#(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)); {9994#true} is VALID [2022-04-27 13:50:07,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,879 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9994#true} {10124#(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; {10124#(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-27 13:50:07,880 INFO L272 TraceCheckUtils]: 54: Hoare triple {10124#(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)); {9994#true} is VALID [2022-04-27 13:50:07,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,881 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9994#true} {10124#(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; {10124#(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-27 13:50:07,881 INFO L290 TraceCheckUtils]: 59: Hoare triple {10124#(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); {10124#(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-27 13:50:07,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#(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; {10124#(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-27 13:50:07,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#(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; {10124#(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-27 13:50:07,882 INFO L272 TraceCheckUtils]: 62: Hoare triple {10124#(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)); {9994#true} is VALID [2022-04-27 13:50:07,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,883 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9994#true} {10124#(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; {10124#(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-27 13:50:07,883 INFO L272 TraceCheckUtils]: 67: Hoare triple {10124#(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)); {9994#true} is VALID [2022-04-27 13:50:07,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,883 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9994#true} {10124#(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; {10124#(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-27 13:50:07,884 INFO L290 TraceCheckUtils]: 72: Hoare triple {10124#(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); {10069#(and (= main_~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-27 13:50:07,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {10069#(and (= main_~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; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:50:07,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:50:07,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:50:07,885 INFO L272 TraceCheckUtils]: 76: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~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)); {9994#true} is VALID [2022-04-27 13:50:07,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,885 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,888 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9994#true} {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:50:07,888 INFO L272 TraceCheckUtils]: 81: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:07,888 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:07,888 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:07,888 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:07,889 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9994#true} {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #86#return; {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-27 13:50:07,890 INFO L290 TraceCheckUtils]: 86: Hoare triple {10221#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~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); {10261#(and (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (+ (- 2) main_~q~0) 0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:50:07,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {10261#(and (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (+ (- 2) main_~q~0) 0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10265#(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-27 13:50:07,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {10265#(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; {10265#(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-27 13:50:07,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {10265#(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; {10265#(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-27 13:50:07,893 INFO L272 TraceCheckUtils]: 90: Hoare triple {10265#(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)); {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:50:07,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:50:07,894 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:50:07,894 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:50:07,894 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-27 13:50:07,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:50:26,702 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:50:26,702 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:50:26,703 INFO L290 TraceCheckUtils]: 91: Hoare triple {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10279#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:50:26,704 INFO L272 TraceCheckUtils]: 90: Hoare triple {10295#(= (+ (* 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)); {10275#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:50:26,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:50:26,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:50:26,720 INFO L290 TraceCheckUtils]: 87: Hoare triple {10305#(= 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; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:50:26,741 INFO L290 TraceCheckUtils]: 86: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (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); {10305#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-27 13:50:26,742 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9994#true} {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #86#return; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:50:26,742 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:26,742 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:26,742 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:26,743 INFO L272 TraceCheckUtils]: 81: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:26,743 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9994#true} {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #84#return; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:50:26,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:26,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:26,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:26,744 INFO L272 TraceCheckUtils]: 76: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:26,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(#t~post6 < 50);havoc #t~post6; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:50:26,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:50:26,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10309#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-27 13:50:27,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 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); {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,247 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #86#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,248 INFO L272 TraceCheckUtils]: 67: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,249 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #84#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,250 INFO L272 TraceCheckUtils]: 62: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,258 INFO L290 TraceCheckUtils]: 60: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !(~r~0 >= ~d~0); {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,262 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #82#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,263 INFO L272 TraceCheckUtils]: 54: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,264 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #80#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,265 INFO L272 TraceCheckUtils]: 49: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,266 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9994#true} {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #78#return; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,266 INFO L272 TraceCheckUtils]: 44: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post5 < 50);havoc #t~post5; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10353#(and (or (and (or (and (or (and (or (= (+ (- 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 (= 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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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)))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~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) (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 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) (= 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 (+ (* (+ 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_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (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) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (= 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))))) (or (= 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)))) (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (or (not (< (div main_~d~0 2) 0)) (= 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_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 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)) (or (not (< (div main_~d~0 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)))) (= (mod (div main_~d~0 2) 2) 0))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,459 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #82#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,459 INFO L272 TraceCheckUtils]: 36: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,460 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #80#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,460 INFO L272 TraceCheckUtils]: 31: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,461 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9994#true} {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #78#return; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,462 INFO L272 TraceCheckUtils]: 26: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9994#true} is VALID [2022-04-27 13:50:27,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post5 < 50);havoc #t~post5; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {10501#(= (+ (* (* 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; {10349#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (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)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~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 (not (< main_~p~0 0)) (and (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) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (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_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:50:27,497 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9994#true} {10501#(= (+ (* (* 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; {10501#(= (+ (* (* 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-27 13:50:27,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {10501#(= (+ (* (* 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)); {9994#true} is VALID [2022-04-27 13:50:27,498 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9994#true} {10501#(= (+ (* (* 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; {10501#(= (+ (* (* 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-27 13:50:27,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,498 INFO L272 TraceCheckUtils]: 13: Hoare triple {10501#(= (+ (* (* 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)); {9994#true} is VALID [2022-04-27 13:50:27,499 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9994#true} {10501#(= (+ (* (* 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; {10501#(= (+ (* (* 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-27 13:50:27,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:50:27,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:50:27,499 INFO L272 TraceCheckUtils]: 8: Hoare triple {10501#(= (+ (* (* 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)); {9994#true} is VALID [2022-04-27 13:50:27,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {10501#(= (+ (* (* 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; {10501#(= (+ (* (* 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-27 13:50:27,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {10501#(= (+ (* (* 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; {10501#(= (+ (* (* 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-27 13:50:27,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {9994#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; {10501#(= (+ (* (* 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-27 13:50:27,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:50:27,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:50:27,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:50:27,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {9994#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; {9994#true} is VALID [2022-04-27 13:50:27,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:50:27,502 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-27 13:50:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:50:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545572280] [2022-04-27 13:50:27,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:50:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384513379] [2022-04-27 13:50:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384513379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:50:27,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:50:27,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:50:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801415596] [2022-04-27 13:50:27,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:50:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:50:27,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:50:27,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:50:28,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:50:28,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:50:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:50:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:50:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:50:28,243 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:50:46,621 WARN L232 SmtUtils]: Spent 17.06s on a formula simplification. DAG size of input: 192 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:51:03,527 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-27 13:51:14,893 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-27 13:51:21,048 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-27 13:51:23,776 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-27 13:51:25,781 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-27 13:51:28,023 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-27 13:51:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:41,856 INFO L93 Difference]: Finished difference Result 332 states and 434 transitions. [2022-04-27 13:51:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 13:51:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2022-04-27 13:51:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:51:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:51:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:51:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:51:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:51:41,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 204 transitions. [2022-04-27 13:51:42,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:42,946 INFO L225 Difference]: With dead ends: 332 [2022-04-27 13:51:42,947 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 13:51:42,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:51:42,948 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 187 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:51:42,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 368 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 765 Invalid, 6 Unknown, 0 Unchecked, 21.3s Time] [2022-04-27 13:51:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 13:51:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2022-04-27 13:51:43,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:51:43,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:51:43,089 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:51:43,090 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:51:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:43,098 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:51:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:51:43,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:43,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:43,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 275 states. [2022-04-27 13:51:43,100 INFO L87 Difference]: Start difference. First operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) Second operand 275 states. [2022-04-27 13:51:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:43,108 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:51:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:51:43,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:43,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:43,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:51:43,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:51:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 172 states have (on average 1.2267441860465116) internal successors, (211), 177 states have internal predecessors, (211), 57 states have call successors, (57), 28 states have call predecessors, (57), 27 states have return successors, (55), 51 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:51:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2022-04-27 13:51:43,117 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 94 [2022-04-27 13:51:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:51:43,117 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2022-04-27 13:51:43,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2022-04-27 13:51:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2022-04-27 13:51:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 13:51:43,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:51:43,119 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:51:43,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:51:43,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 13:51:43,344 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:51:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:51:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1539828763, now seen corresponding path program 1 times [2022-04-27 13:51:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:51:43,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546972109] [2022-04-27 13:51:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:51:43,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:51:43,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696431689] [2022-04-27 13:51:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:51:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:51:43,361 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-27 13:51:43,365 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-27 13:51:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:43,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:51:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:43,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:51:43,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:51:43,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {11941#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; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:43,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {11949#(<= ~counter~0 0)} assume true; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:43,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11949#(<= ~counter~0 0)} {11941#true} #92#return; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:43,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {11949#(<= ~counter~0 0)} call #t~ret7 := main(); {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:43,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {11949#(<= ~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; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:43,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {11949#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {11965#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,830 INFO L272 TraceCheckUtils]: 8: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,832 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #78#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,832 INFO L272 TraceCheckUtils]: 13: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,833 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #80#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,834 INFO L272 TraceCheckUtils]: 18: Hoare triple {11965#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,835 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11965#(<= ~counter~0 1)} {11965#(<= ~counter~0 1)} #82#return; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {11965#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:43,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {11965#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {12020#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,837 INFO L272 TraceCheckUtils]: 26: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,838 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #78#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,838 INFO L272 TraceCheckUtils]: 31: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,839 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #80#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,840 INFO L272 TraceCheckUtils]: 36: Hoare triple {12020#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,841 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12020#(<= ~counter~0 2)} {12020#(<= ~counter~0 2)} #82#return; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {12020#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:43,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {12020#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {12075#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,843 INFO L272 TraceCheckUtils]: 44: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,844 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #78#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,844 INFO L272 TraceCheckUtils]: 49: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,845 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #80#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,846 INFO L272 TraceCheckUtils]: 54: Hoare triple {12075#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,848 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12075#(<= ~counter~0 3)} {12075#(<= ~counter~0 3)} #82#return; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {12075#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:43,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {12075#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {12130#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,849 INFO L272 TraceCheckUtils]: 62: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,851 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #78#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,852 INFO L272 TraceCheckUtils]: 67: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,853 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #80#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,854 INFO L272 TraceCheckUtils]: 72: Hoare triple {12130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,856 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12130#(<= ~counter~0 4)} {12130#(<= ~counter~0 4)} #82#return; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {12130#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:43,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {12130#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12185#(<= |main_#t~post5| 4)} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {12185#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 50);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L272 TraceCheckUtils]: 82: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11942#false} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:51:43,857 INFO L272 TraceCheckUtils]: 87: Hoare triple {11942#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11942#false} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {11942#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); {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 93: Hoare triple {11942#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 50);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L272 TraceCheckUtils]: 96: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:51:43,858 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:51:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 120 proven. 260 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-27 13:51:43,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L272 TraceCheckUtils]: 96: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 50);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 94: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 93: Hoare triple {11942#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {11942#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); {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11941#true} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,259 INFO L290 TraceCheckUtils]: 89: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 88: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L272 TraceCheckUtils]: 87: Hoare triple {11942#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11941#true} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 85: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L272 TraceCheckUtils]: 82: Hoare triple {11942#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 50);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {11942#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11942#false} is VALID [2022-04-27 13:51:44,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {12309#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:51:44,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {12313#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12309#(< |main_#t~post5| 50)} is VALID [2022-04-27 13:51:44,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {12313#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,261 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11941#true} {12313#(< ~counter~0 50)} #82#return; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,262 INFO L272 TraceCheckUtils]: 72: Hoare triple {12313#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,262 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11941#true} {12313#(< ~counter~0 50)} #80#return; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,262 INFO L272 TraceCheckUtils]: 67: Hoare triple {12313#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,263 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11941#true} {12313#(< ~counter~0 50)} #78#return; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,263 INFO L272 TraceCheckUtils]: 62: Hoare triple {12313#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,263 INFO L290 TraceCheckUtils]: 61: Hoare triple {12313#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {12368#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12313#(< ~counter~0 50)} is VALID [2022-04-27 13:51:44,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {12368#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,264 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11941#true} {12368#(< ~counter~0 49)} #82#return; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L272 TraceCheckUtils]: 54: Hoare triple {12368#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11941#true} {12368#(< ~counter~0 49)} #80#return; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,265 INFO L272 TraceCheckUtils]: 49: Hoare triple {12368#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,266 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11941#true} {12368#(< ~counter~0 49)} #78#return; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,266 INFO L272 TraceCheckUtils]: 44: Hoare triple {12368#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {12368#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {12423#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12368#(< ~counter~0 49)} is VALID [2022-04-27 13:51:44,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {12423#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,267 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11941#true} {12423#(< ~counter~0 48)} #82#return; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L272 TraceCheckUtils]: 36: Hoare triple {12423#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {11941#true} {12423#(< ~counter~0 48)} #80#return; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,268 INFO L272 TraceCheckUtils]: 31: Hoare triple {12423#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,269 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11941#true} {12423#(< ~counter~0 48)} #78#return; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,269 INFO L272 TraceCheckUtils]: 26: Hoare triple {12423#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {12478#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12423#(< ~counter~0 48)} is VALID [2022-04-27 13:51:44,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {12478#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,271 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11941#true} {12478#(< ~counter~0 47)} #82#return; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L272 TraceCheckUtils]: 18: Hoare triple {12478#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11941#true} {12478#(< ~counter~0 47)} #80#return; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,271 INFO L272 TraceCheckUtils]: 13: Hoare triple {12478#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,272 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11941#true} {12478#(< ~counter~0 47)} #78#return; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:51:44,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:51:44,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:51:44,272 INFO L272 TraceCheckUtils]: 8: Hoare triple {12478#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:51:44,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {12478#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {12533#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12478#(< ~counter~0 47)} is VALID [2022-04-27 13:51:44,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {12533#(< ~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; {12533#(< ~counter~0 46)} is VALID [2022-04-27 13:51:44,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {12533#(< ~counter~0 46)} call #t~ret7 := main(); {12533#(< ~counter~0 46)} is VALID [2022-04-27 13:51:44,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12533#(< ~counter~0 46)} {11941#true} #92#return; {12533#(< ~counter~0 46)} is VALID [2022-04-27 13:51:44,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {12533#(< ~counter~0 46)} assume true; {12533#(< ~counter~0 46)} is VALID [2022-04-27 13:51:44,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {11941#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; {12533#(< ~counter~0 46)} is VALID [2022-04-27 13:51:44,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:51:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-27 13:51:44,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:51:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546972109] [2022-04-27 13:51:44,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:51:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696431689] [2022-04-27 13:51:44,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696431689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:51:44,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:51:44,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:51:44,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922139614] [2022-04-27 13:51:44,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:51:44,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100 [2022-04-27 13:51:44,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:51:44,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:51:44,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:44,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:51:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:51:44,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:51:44,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:51:44,368 INFO L87 Difference]: Start difference. First operand 257 states and 323 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:51:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:45,728 INFO L93 Difference]: Finished difference Result 746 states and 1016 transitions. [2022-04-27 13:51:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 13:51:45,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) Word has length 100 [2022-04-27 13:51:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:51:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:51:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:51:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:51:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:51:45,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-27 13:51:45,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:46,033 INFO L225 Difference]: With dead ends: 746 [2022-04-27 13:51:46,033 INFO L226 Difference]: Without dead ends: 659 [2022-04-27 13:51:46,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:51:46,037 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 208 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:51:46,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 286 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:51:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-04-27 13:51:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 552. [2022-04-27 13:51:46,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:51:46,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:51:46,448 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:51:46,449 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:51:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:46,473 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:51:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:51:46,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:46,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:46,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 659 states. [2022-04-27 13:51:46,477 INFO L87 Difference]: Start difference. First operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 659 states. [2022-04-27 13:51:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:46,502 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:51:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:51:46,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:46,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:46,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:51:46,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:51:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 361 states have (on average 1.2825484764542936) internal successors, (463), 378 states have internal predecessors, (463), 136 states have call successors, (136), 56 states have call predecessors, (136), 54 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-27 13:51:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 730 transitions. [2022-04-27 13:51:46,529 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 730 transitions. Word has length 100 [2022-04-27 13:51:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:51:46,530 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 730 transitions. [2022-04-27 13:51:46,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 12 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (30), 11 states have call predecessors, (30), 10 states have call successors, (30) [2022-04-27 13:51:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 730 transitions. [2022-04-27 13:51:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-27 13:51:46,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:51:46,532 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:51:46,561 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-27 13:51:46,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 13:51:46,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:51:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:51:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 1 times [2022-04-27 13:51:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:51:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182336397] [2022-04-27 13:51:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:51:46,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:51:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922974579] [2022-04-27 13:51:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:51:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:51:46,784 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-27 13:51:46,785 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-27 13:51:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:46,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:51:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:46,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:51:47,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:51:47,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {15651#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; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:47,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {15659#(<= ~counter~0 0)} assume true; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:47,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15659#(<= ~counter~0 0)} {15651#true} #92#return; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:47,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {15659#(<= ~counter~0 0)} call #t~ret7 := main(); {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:47,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {15659#(<= ~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; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:51:47,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {15659#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {15675#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,415 INFO L272 TraceCheckUtils]: 8: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,416 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #78#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,418 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #80#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,418 INFO L272 TraceCheckUtils]: 18: Hoare triple {15675#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,419 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15675#(<= ~counter~0 1)} {15675#(<= ~counter~0 1)} #82#return; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {15675#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:51:47,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {15675#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {15730#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,421 INFO L272 TraceCheckUtils]: 26: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,422 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #78#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,423 INFO L272 TraceCheckUtils]: 31: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,424 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #80#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,424 INFO L272 TraceCheckUtils]: 36: Hoare triple {15730#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,425 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15730#(<= ~counter~0 2)} {15730#(<= ~counter~0 2)} #82#return; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {15730#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:51:47,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {15730#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {15785#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,427 INFO L272 TraceCheckUtils]: 44: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,428 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #78#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,429 INFO L272 TraceCheckUtils]: 49: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,430 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #80#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,430 INFO L272 TraceCheckUtils]: 54: Hoare triple {15785#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,437 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15785#(<= ~counter~0 3)} {15785#(<= ~counter~0 3)} #82#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {15785#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:51:47,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {15785#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {15840#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,439 INFO L272 TraceCheckUtils]: 62: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,440 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #84#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,441 INFO L272 TraceCheckUtils]: 67: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,442 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15840#(<= ~counter~0 4)} {15840#(<= ~counter~0 4)} #86#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {15840#(<= ~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); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {15840#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:51:47,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {15840#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {15883#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,444 INFO L272 TraceCheckUtils]: 76: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,444 INFO L290 TraceCheckUtils]: 78: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,445 INFO L290 TraceCheckUtils]: 79: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,445 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #84#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,446 INFO L272 TraceCheckUtils]: 81: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,446 INFO L290 TraceCheckUtils]: 83: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,447 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15883#(<= ~counter~0 5)} {15883#(<= ~counter~0 5)} #86#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,447 INFO L290 TraceCheckUtils]: 86: Hoare triple {15883#(<= ~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); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,447 INFO L290 TraceCheckUtils]: 87: Hoare triple {15883#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:51:47,450 INFO L290 TraceCheckUtils]: 88: Hoare triple {15883#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {15926#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,451 INFO L272 TraceCheckUtils]: 90: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,452 INFO L290 TraceCheckUtils]: 93: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,453 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #84#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,453 INFO L272 TraceCheckUtils]: 95: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,454 INFO L290 TraceCheckUtils]: 97: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,454 INFO L290 TraceCheckUtils]: 98: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,454 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15926#(<= ~counter~0 6)} {15926#(<= ~counter~0 6)} #86#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,455 INFO L290 TraceCheckUtils]: 100: Hoare triple {15926#(<= ~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); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,455 INFO L290 TraceCheckUtils]: 101: Hoare triple {15926#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:51:47,455 INFO L290 TraceCheckUtils]: 102: Hoare triple {15926#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15969#(<= |main_#t~post6| 6)} is VALID [2022-04-27 13:51:47,456 INFO L290 TraceCheckUtils]: 103: Hoare triple {15969#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:51:47,456 INFO L272 TraceCheckUtils]: 104: Hoare triple {15652#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15652#false} is VALID [2022-04-27 13:51:47,456 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:51:47,456 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:51:47,456 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:51:47,456 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-27 13:51:47,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:51:47,963 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:51:47,963 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:51:47,963 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:51:47,964 INFO L272 TraceCheckUtils]: 104: Hoare triple {15652#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15652#false} is VALID [2022-04-27 13:51:47,964 INFO L290 TraceCheckUtils]: 103: Hoare triple {15997#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:51:47,964 INFO L290 TraceCheckUtils]: 102: Hoare triple {16001#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15997#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:51:47,964 INFO L290 TraceCheckUtils]: 101: Hoare triple {16001#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {16001#(< ~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); {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,965 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15651#true} {16001#(< ~counter~0 50)} #86#return; {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,965 INFO L272 TraceCheckUtils]: 95: Hoare triple {16001#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,966 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15651#true} {16001#(< ~counter~0 50)} #84#return; {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,966 INFO L290 TraceCheckUtils]: 93: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,966 INFO L290 TraceCheckUtils]: 92: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,966 INFO L290 TraceCheckUtils]: 91: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,966 INFO L272 TraceCheckUtils]: 90: Hoare triple {16001#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {16001#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,967 INFO L290 TraceCheckUtils]: 88: Hoare triple {16044#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16001#(< ~counter~0 50)} is VALID [2022-04-27 13:51:47,967 INFO L290 TraceCheckUtils]: 87: Hoare triple {16044#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,968 INFO L290 TraceCheckUtils]: 86: Hoare triple {16044#(< ~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); {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,968 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15651#true} {16044#(< ~counter~0 49)} #86#return; {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,968 INFO L290 TraceCheckUtils]: 84: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,968 INFO L290 TraceCheckUtils]: 83: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,968 INFO L272 TraceCheckUtils]: 81: Hoare triple {16044#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,969 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15651#true} {16044#(< ~counter~0 49)} #84#return; {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,969 INFO L272 TraceCheckUtils]: 76: Hoare triple {16044#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {16044#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,970 INFO L290 TraceCheckUtils]: 74: Hoare triple {16087#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16044#(< ~counter~0 49)} is VALID [2022-04-27 13:51:47,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {16087#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {16087#(< ~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); {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,971 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15651#true} {16087#(< ~counter~0 48)} #86#return; {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,971 INFO L272 TraceCheckUtils]: 67: Hoare triple {16087#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,972 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15651#true} {16087#(< ~counter~0 48)} #84#return; {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,972 INFO L272 TraceCheckUtils]: 62: Hoare triple {16087#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {16087#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {16130#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16087#(< ~counter~0 48)} is VALID [2022-04-27 13:51:47,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {16130#(< ~counter~0 47)} assume !(~r~0 >= ~d~0); {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,974 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15651#true} {16130#(< ~counter~0 47)} #82#return; {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L272 TraceCheckUtils]: 54: Hoare triple {16130#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15651#true} {16130#(< ~counter~0 47)} #80#return; {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,974 INFO L272 TraceCheckUtils]: 49: Hoare triple {16130#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,975 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15651#true} {16130#(< ~counter~0 47)} #78#return; {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,975 INFO L272 TraceCheckUtils]: 44: Hoare triple {16130#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {16130#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {16185#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16130#(< ~counter~0 47)} is VALID [2022-04-27 13:51:47,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {16185#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,977 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15651#true} {16185#(< ~counter~0 46)} #82#return; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,977 INFO L272 TraceCheckUtils]: 36: Hoare triple {16185#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,977 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15651#true} {16185#(< ~counter~0 46)} #80#return; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,978 INFO L272 TraceCheckUtils]: 31: Hoare triple {16185#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,979 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15651#true} {16185#(< ~counter~0 46)} #78#return; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,980 INFO L272 TraceCheckUtils]: 26: Hoare triple {16185#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {16185#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {16240#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16185#(< ~counter~0 46)} is VALID [2022-04-27 13:51:47,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {16240#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,982 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15651#true} {16240#(< ~counter~0 45)} #82#return; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {16240#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,983 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15651#true} {16240#(< ~counter~0 45)} #80#return; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,984 INFO L272 TraceCheckUtils]: 13: Hoare triple {16240#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,984 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15651#true} {16240#(< ~counter~0 45)} #78#return; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:51:47,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:51:47,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:51:47,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {16240#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:51:47,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {16240#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {16295#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16240#(< ~counter~0 45)} is VALID [2022-04-27 13:51:47,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {16295#(< ~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; {16295#(< ~counter~0 44)} is VALID [2022-04-27 13:51:47,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {16295#(< ~counter~0 44)} call #t~ret7 := main(); {16295#(< ~counter~0 44)} is VALID [2022-04-27 13:51:47,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16295#(< ~counter~0 44)} {15651#true} #92#return; {16295#(< ~counter~0 44)} is VALID [2022-04-27 13:51:47,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {16295#(< ~counter~0 44)} assume true; {16295#(< ~counter~0 44)} is VALID [2022-04-27 13:51:47,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {15651#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; {16295#(< ~counter~0 44)} is VALID [2022-04-27 13:51:47,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:51:47,989 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-27 13:51:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:51:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182336397] [2022-04-27 13:51:47,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:51:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922974579] [2022-04-27 13:51:47,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922974579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:51:47,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:51:47,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:51:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993637735] [2022-04-27 13:51:47,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:51:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) Word has length 108 [2022-04-27 13:51:47,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:51:47,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:51:48,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:51:48,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:51:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:51:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:51:48,113 INFO L87 Difference]: Start difference. First operand 552 states and 730 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:51:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:50,575 INFO L93 Difference]: Finished difference Result 1159 states and 1613 transitions. [2022-04-27 13:51:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 13:51:50,575 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) Word has length 108 [2022-04-27 13:51:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:51:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:51:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-27 13:51:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:51:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 363 transitions. [2022-04-27 13:51:50,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 363 transitions. [2022-04-27 13:51:50,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:51,003 INFO L225 Difference]: With dead ends: 1159 [2022-04-27 13:51:51,004 INFO L226 Difference]: Without dead ends: 1122 [2022-04-27 13:51:51,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:51:51,006 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 345 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:51:51,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 402 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:51:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-04-27 13:51:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1097. [2022-04-27 13:51:51,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:51:51,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:51,796 INFO L74 IsIncluded]: Start isIncluded. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:51,798 INFO L87 Difference]: Start difference. First operand 1122 states. Second operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:51,860 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-27 13:51:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-27 13:51:51,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:51,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:51,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1122 states. [2022-04-27 13:51:51,868 INFO L87 Difference]: Start difference. First operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1122 states. [2022-04-27 13:51:51,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:51,930 INFO L93 Difference]: Finished difference Result 1122 states and 1474 transitions. [2022-04-27 13:51:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1474 transitions. [2022-04-27 13:51:51,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:51,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:51,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:51:51,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:51:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 729 states have (on average 1.2455418381344308) internal successors, (908), 758 states have internal predecessors, (908), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1457 transitions. [2022-04-27 13:51:52,009 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1457 transitions. Word has length 108 [2022-04-27 13:51:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:51:52,009 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1457 transitions. [2022-04-27 13:51:52,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 16 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2022-04-27 13:51:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1457 transitions. [2022-04-27 13:51:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 13:51:52,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:51:52,013 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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, 1, 1] [2022-04-27 13:51:52,041 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-27 13:51:52,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:51:52,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:51:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:51:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1873291208, now seen corresponding path program 1 times [2022-04-27 13:51:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:51:52,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565898820] [2022-04-27 13:51:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:51:52,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:51:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407489461] [2022-04-27 13:51:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:51:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:51:52,261 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-27 13:51:52,278 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-27 13:51:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:52,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 13:51:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:52,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:51:52,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-27 13:51:52,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {21622#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; {21622#true} is VALID [2022-04-27 13:51:52,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-27 13:51:52,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {21622#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; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post5 < 50);havoc #t~post5; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,867 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #78#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,867 INFO L272 TraceCheckUtils]: 13: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,868 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #80#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,868 INFO L272 TraceCheckUtils]: 18: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,868 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #82#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post5 < 50);havoc #t~post5; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #78#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,870 INFO L272 TraceCheckUtils]: 31: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,871 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #80#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,871 INFO L272 TraceCheckUtils]: 36: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,872 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #82#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post5 < 50);havoc #t~post5; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,873 INFO L272 TraceCheckUtils]: 44: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,874 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #78#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,874 INFO L272 TraceCheckUtils]: 49: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,888 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #80#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,888 INFO L272 TraceCheckUtils]: 54: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,888 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,889 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #82#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !(~r~0 >= ~d~0); {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post6 < 50);havoc #t~post6; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,890 INFO L272 TraceCheckUtils]: 62: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,890 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,891 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #84#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,891 INFO L272 TraceCheckUtils]: 67: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,891 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21622#true} {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #86#return; {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:51:52,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {21752#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~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); {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,893 INFO L290 TraceCheckUtils]: 73: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,893 INFO L290 TraceCheckUtils]: 74: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,893 INFO L290 TraceCheckUtils]: 75: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post6 < 50);havoc #t~post6; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,894 INFO L272 TraceCheckUtils]: 76: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #84#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,894 INFO L272 TraceCheckUtils]: 81: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,894 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,895 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {21622#true} {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #86#return; {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:51:52,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {21697#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~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); {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,896 INFO L290 TraceCheckUtils]: 87: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,897 INFO L290 TraceCheckUtils]: 89: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 50);havoc #t~post6; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,897 INFO L272 TraceCheckUtils]: 90: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,897 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,897 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,897 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,897 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #84#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,898 INFO L272 TraceCheckUtils]: 95: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,898 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,898 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,898 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,898 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #86#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,898 INFO L290 TraceCheckUtils]: 100: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,899 INFO L272 TraceCheckUtils]: 101: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:52,899 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:52,899 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:52,899 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:52,899 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21622#true} {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #88#return; {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:51:52,900 INFO L272 TraceCheckUtils]: 106: Hoare triple {21642#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:51:52,900 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:51:52,900 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-27 13:51:52,900 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-27 13:51:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 13:51:52,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:51:54,143 INFO L290 TraceCheckUtils]: 109: Hoare triple {21623#false} assume !false; {21623#false} is VALID [2022-04-27 13:51:54,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {21952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21623#false} is VALID [2022-04-27 13:51:54,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:51:54,144 INFO L272 TraceCheckUtils]: 106: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {21948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:51:54,144 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #88#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,144 INFO L290 TraceCheckUtils]: 104: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,144 INFO L290 TraceCheckUtils]: 103: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L290 TraceCheckUtils]: 102: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L272 TraceCheckUtils]: 101: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !(1 != ~p~0); {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,145 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #86#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,145 INFO L290 TraceCheckUtils]: 98: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L290 TraceCheckUtils]: 97: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,145 INFO L272 TraceCheckUtils]: 95: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,146 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #84#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,146 INFO L272 TraceCheckUtils]: 90: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(#t~post6 < 50);havoc #t~post6; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {21968#(= main_~B~0 main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~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); {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,149 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #86#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,149 INFO L290 TraceCheckUtils]: 83: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,149 INFO L290 TraceCheckUtils]: 82: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,149 INFO L272 TraceCheckUtils]: 81: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,150 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #84#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,150 INFO L272 TraceCheckUtils]: 76: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~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); {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,155 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #86#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,155 INFO L290 TraceCheckUtils]: 70: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,155 INFO L290 TraceCheckUtils]: 69: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,155 INFO L272 TraceCheckUtils]: 67: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,156 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #84#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,156 INFO L290 TraceCheckUtils]: 63: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,156 INFO L272 TraceCheckUtils]: 62: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !(~r~0 >= ~d~0); {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,160 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #82#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L272 TraceCheckUtils]: 54: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #80#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 51: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,160 INFO L272 TraceCheckUtils]: 49: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,161 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {21622#true} {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #78#return; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,161 INFO L272 TraceCheckUtils]: 44: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post5 < 50);havoc #t~post5; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22072#(and (or (and (or (not (< (div main_~d~0 2) 0)) (= (+ (div (div main_~d~0 2) 2) 1) main_~B~0) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (= (div (div main_~d~0 2) 2) main_~B~0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (and (or (= (+ (div (+ (div main_~d~0 2) 1) 2) 1) main_~B~0) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (= main_~B~0 (div (+ (div main_~d~0 2) 1) 2)) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,166 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #82#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,166 INFO L272 TraceCheckUtils]: 36: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,167 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #80#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,167 INFO L272 TraceCheckUtils]: 31: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,167 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21622#true} {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #78#return; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,168 INFO L272 TraceCheckUtils]: 26: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} assume !!(#t~post5 < 50);havoc #t~post5; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22029#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= main_~B~0 (div main_~d~0 2))) (or (= (+ (div main_~d~0 2) 1) main_~B~0) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-27 13:51:54,171 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #82#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,171 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #80#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L272 TraceCheckUtils]: 13: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21622#true} {21968#(= main_~B~0 main_~d~0)} #78#return; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {21622#true} assume !(0 == ~cond); {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {21622#true} ~cond := #in~cond; {21622#true} is VALID [2022-04-27 13:51:54,172 INFO L272 TraceCheckUtils]: 8: Hoare triple {21968#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21622#true} is VALID [2022-04-27 13:51:54,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {21968#(= main_~B~0 main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {21968#(= main_~B~0 main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {21622#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; {21968#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:51:54,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {21622#true} call #t~ret7 := main(); {21622#true} is VALID [2022-04-27 13:51:54,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21622#true} {21622#true} #92#return; {21622#true} is VALID [2022-04-27 13:51:54,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {21622#true} assume true; {21622#true} is VALID [2022-04-27 13:51:54,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {21622#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; {21622#true} is VALID [2022-04-27 13:51:54,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {21622#true} call ULTIMATE.init(); {21622#true} is VALID [2022-04-27 13:51:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-27 13:51:54,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:51:54,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565898820] [2022-04-27 13:51:54,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:51:54,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407489461] [2022-04-27 13:51:54,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407489461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:51:54,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:51:54,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:51:54,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712727464] [2022-04-27 13:51:54,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:51:54,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 110 [2022-04-27 13:51:54,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:51:54,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:51:54,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:51:54,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:51:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:51:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:51:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:51:54,301 INFO L87 Difference]: Start difference. First operand 1097 states and 1457 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:51:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:57,156 INFO L93 Difference]: Finished difference Result 1103 states and 1463 transitions. [2022-04-27 13:51:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:51:57,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 110 [2022-04-27 13:51:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:51:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:51:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:51:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:51:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:51:57,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-27 13:51:57,267 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-27 13:51:57,340 INFO L225 Difference]: With dead ends: 1103 [2022-04-27 13:51:57,340 INFO L226 Difference]: Without dead ends: 1097 [2022-04-27 13:51:57,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:51:57,342 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:51:57,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 328 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 13:51:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-04-27 13:51:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2022-04-27 13:51:58,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:51:58,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:58,177 INFO L74 IsIncluded]: Start isIncluded. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:58,179 INFO L87 Difference]: Start difference. First operand 1097 states. Second operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:58,239 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-27 13:51:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:51:58,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:58,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:58,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1097 states. [2022-04-27 13:51:58,246 INFO L87 Difference]: Start difference. First operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) Second operand 1097 states. [2022-04-27 13:51:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:51:58,306 INFO L93 Difference]: Finished difference Result 1097 states and 1455 transitions. [2022-04-27 13:51:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:51:58,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:51:58,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:51:58,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:51:58,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:51:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 729 states have (on average 1.242798353909465) internal successors, (906), 758 states have internal predecessors, (906), 279 states have call successors, (279), 90 states have call predecessors, (279), 88 states have return successors, (270), 248 states have call predecessors, (270), 270 states have call successors, (270) [2022-04-27 13:51:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1455 transitions. [2022-04-27 13:51:58,394 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1455 transitions. Word has length 110 [2022-04-27 13:51:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:51:58,394 INFO L495 AbstractCegarLoop]: Abstraction has 1097 states and 1455 transitions. [2022-04-27 13:51:58,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 7 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-04-27 13:51:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1455 transitions. [2022-04-27 13:51:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 13:51:58,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:51:58,397 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:51:58,425 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-27 13:51:58,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:51:58,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:51:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:51:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1491499276, now seen corresponding path program 2 times [2022-04-27 13:51:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:51:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251722945] [2022-04-27 13:51:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:51:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:51:58,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:51:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205202344] [2022-04-27 13:51:58,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:51:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:51:58,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:51:58,637 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-27 13:51:58,669 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-27 13:51:58,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:51:58,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:51:58,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:51:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:51:58,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:51:59,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-27 13:51:59,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {27456#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; {27456#true} is VALID [2022-04-27 13:51:59,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-27 13:51:59,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-27 13:51:59,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {27456#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; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {27476#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {27476#(= main_~p~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,086 INFO L272 TraceCheckUtils]: 8: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,086 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #78#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,087 INFO L272 TraceCheckUtils]: 13: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,087 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #80#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #82#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {27476#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {27531#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {27531#(= main_~p~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,090 INFO L272 TraceCheckUtils]: 26: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,090 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #78#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,090 INFO L272 TraceCheckUtils]: 31: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #80#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,091 INFO L272 TraceCheckUtils]: 36: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,092 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #82#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {27531#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {27586#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {27586#(= main_~p~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,093 INFO L272 TraceCheckUtils]: 44: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,094 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #78#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,094 INFO L272 TraceCheckUtils]: 49: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,095 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #80#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,095 INFO L272 TraceCheckUtils]: 54: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,095 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #82#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {27586#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {27586#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {27586#(= main_~p~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,096 INFO L272 TraceCheckUtils]: 62: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,097 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #84#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,097 INFO L272 TraceCheckUtils]: 67: Hoare triple {27586#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,098 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27456#true} {27586#(= main_~p~0 4)} #86#return; {27586#(= main_~p~0 4)} is VALID [2022-04-27 13:51:59,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {27586#(= 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); {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {27531#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {27531#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {27531#(= main_~p~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,100 INFO L272 TraceCheckUtils]: 76: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,100 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #84#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,100 INFO L272 TraceCheckUtils]: 81: Hoare triple {27531#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,101 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27456#true} {27531#(= main_~p~0 2)} #86#return; {27531#(= main_~p~0 2)} is VALID [2022-04-27 13:51:59,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {27531#(= 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); {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,102 INFO L290 TraceCheckUtils]: 87: Hoare triple {27476#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,102 INFO L290 TraceCheckUtils]: 88: Hoare triple {27476#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,102 INFO L290 TraceCheckUtils]: 89: Hoare triple {27476#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,102 INFO L272 TraceCheckUtils]: 90: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #84#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,103 INFO L272 TraceCheckUtils]: 95: Hoare triple {27476#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,103 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,104 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27456#true} {27476#(= main_~p~0 1)} #86#return; {27476#(= main_~p~0 1)} is VALID [2022-04-27 13:51:59,104 INFO L290 TraceCheckUtils]: 100: Hoare triple {27476#(= 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); {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,104 INFO L290 TraceCheckUtils]: 101: Hoare triple {27764#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,105 INFO L290 TraceCheckUtils]: 102: Hoare triple {27764#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,105 INFO L290 TraceCheckUtils]: 103: Hoare triple {27764#(<= main_~p~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,105 INFO L272 TraceCheckUtils]: 104: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,105 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,105 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,105 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,106 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,106 INFO L272 TraceCheckUtils]: 109: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:51:59,106 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:51:59,106 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:51:59,106 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:51:59,107 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L272 TraceCheckUtils]: 115: Hoare triple {27457#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 116: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 117: Hoare triple {27457#false} assume !(0 == ~cond); {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {27457#false} assume true; {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27457#false} {27457#false} #88#return; {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L272 TraceCheckUtils]: 120: Hoare triple {27457#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:51:59,107 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-27 13:51:59,108 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-27 13:51:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 102 proven. 51 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-04-27 13:51:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:52:00,198 INFO L290 TraceCheckUtils]: 123: Hoare triple {27457#false} assume !false; {27457#false} is VALID [2022-04-27 13:52:00,198 INFO L290 TraceCheckUtils]: 122: Hoare triple {27457#false} assume 0 == ~cond; {27457#false} is VALID [2022-04-27 13:52:00,198 INFO L290 TraceCheckUtils]: 121: Hoare triple {27457#false} ~cond := #in~cond; {27457#false} is VALID [2022-04-27 13:52:00,198 INFO L272 TraceCheckUtils]: 120: Hoare triple {27457#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {27457#false} is VALID [2022-04-27 13:52:00,199 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {27456#true} {27457#false} #88#return; {27457#false} is VALID [2022-04-27 13:52:00,199 INFO L290 TraceCheckUtils]: 118: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,199 INFO L290 TraceCheckUtils]: 117: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,199 INFO L290 TraceCheckUtils]: 116: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,199 INFO L272 TraceCheckUtils]: 115: Hoare triple {27457#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,199 INFO L290 TraceCheckUtils]: 114: Hoare triple {27764#(<= main_~p~0 0)} assume !(1 != ~p~0); {27457#false} is VALID [2022-04-27 13:52:00,200 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #86#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,200 INFO L290 TraceCheckUtils]: 112: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,200 INFO L290 TraceCheckUtils]: 111: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,200 INFO L290 TraceCheckUtils]: 110: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,200 INFO L272 TraceCheckUtils]: 109: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,201 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27456#true} {27764#(<= main_~p~0 0)} #84#return; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,201 INFO L290 TraceCheckUtils]: 107: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,201 INFO L290 TraceCheckUtils]: 106: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,201 INFO L290 TraceCheckUtils]: 105: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,201 INFO L272 TraceCheckUtils]: 104: Hoare triple {27764#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {27764#(<= main_~p~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,202 INFO L290 TraceCheckUtils]: 102: Hoare triple {27764#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,202 INFO L290 TraceCheckUtils]: 101: Hoare triple {27764#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {27903#(<= (div 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); {27764#(<= main_~p~0 0)} is VALID [2022-04-27 13:52:00,204 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #86#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,204 INFO L272 TraceCheckUtils]: 95: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,205 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #84#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,205 INFO L272 TraceCheckUtils]: 90: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(#t~post6 < 50);havoc #t~post6; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,206 INFO L290 TraceCheckUtils]: 88: Hoare triple {27903#(<= (div main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,206 INFO L290 TraceCheckUtils]: 87: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 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); {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,208 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #86#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,208 INFO L290 TraceCheckUtils]: 84: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,208 INFO L290 TraceCheckUtils]: 83: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,208 INFO L290 TraceCheckUtils]: 82: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,208 INFO L272 TraceCheckUtils]: 81: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,209 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #84#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,209 INFO L290 TraceCheckUtils]: 79: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,209 INFO L290 TraceCheckUtils]: 78: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,209 INFO L272 TraceCheckUtils]: 76: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post6 < 50);havoc #t~post6; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 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); {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,213 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #86#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,213 INFO L272 TraceCheckUtils]: 67: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,214 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #84#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,214 INFO L272 TraceCheckUtils]: 62: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post6 < 50);havoc #t~post6; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !(~r~0 >= ~d~0); {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,216 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #82#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,216 INFO L272 TraceCheckUtils]: 54: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,216 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #80#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L272 TraceCheckUtils]: 49: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27456#true} {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #78#return; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,218 INFO L272 TraceCheckUtils]: 44: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post5 < 50);havoc #t~post5; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27989#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:52:00,220 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #82#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L272 TraceCheckUtils]: 36: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #80#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,221 INFO L272 TraceCheckUtils]: 31: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,222 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27456#true} {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #78#return; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,222 INFO L272 TraceCheckUtils]: 26: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post5 < 50);havoc #t~post5; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27946#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:52:00,225 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #82#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,225 INFO L272 TraceCheckUtils]: 18: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #80#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L272 TraceCheckUtils]: 13: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27456#true} {27903#(<= (div main_~p~0 2) 0)} #78#return; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {27456#true} assume !(0 == ~cond); {27456#true} is VALID [2022-04-27 13:52:00,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {27456#true} ~cond := #in~cond; {27456#true} is VALID [2022-04-27 13:52:00,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {27903#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27456#true} is VALID [2022-04-27 13:52:00,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {27903#(<= (div main_~p~0 2) 0)} assume !!(#t~post5 < 50);havoc #t~post5; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {27903#(<= (div main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {27456#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; {27903#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:52:00,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {27456#true} call #t~ret7 := main(); {27456#true} is VALID [2022-04-27 13:52:00,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27456#true} {27456#true} #92#return; {27456#true} is VALID [2022-04-27 13:52:00,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {27456#true} assume true; {27456#true} is VALID [2022-04-27 13:52:00,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {27456#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; {27456#true} is VALID [2022-04-27 13:52:00,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {27456#true} call ULTIMATE.init(); {27456#true} is VALID [2022-04-27 13:52:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 69 proven. 18 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-27 13:52:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:52:00,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251722945] [2022-04-27 13:52:00,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:52:00,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205202344] [2022-04-27 13:52:00,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205202344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:52:00,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:52:00,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:52:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68727663] [2022-04-27 13:52:00,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:52:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 124 [2022-04-27 13:52:00,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:52:00,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:52:00,376 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-27 13:52:00,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:52:00,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:52:00,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:52:00,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:52:00,378 INFO L87 Difference]: Start difference. First operand 1097 states and 1455 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:52:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:01,694 INFO L93 Difference]: Finished difference Result 1320 states and 1738 transitions. [2022-04-27 13:52:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:52:01,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) Word has length 124 [2022-04-27 13:52:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:52:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:52:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:52:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:52:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:52:01,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-04-27 13:52:01,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:52:01,855 INFO L225 Difference]: With dead ends: 1320 [2022-04-27 13:52:01,855 INFO L226 Difference]: Without dead ends: 907 [2022-04-27 13:52:01,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:52:01,859 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:52:01,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 217 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:52:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-27 13:52:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2022-04-27 13:52:02,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:52:02,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:52:02,545 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:52:02,547 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:52:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:02,590 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-27 13:52:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-27 13:52:02,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:02,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:02,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) Second operand 907 states. [2022-04-27 13:52:02,597 INFO L87 Difference]: Start difference. First operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) Second operand 907 states. [2022-04-27 13:52:02,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:02,637 INFO L93 Difference]: Finished difference Result 907 states and 1156 transitions. [2022-04-27 13:52:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1156 transitions. [2022-04-27 13:52:02,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:02,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:02,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:52:02,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:52:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 598 states have (on average 1.2040133779264215) internal successors, (720), 627 states have internal predecessors, (720), 221 states have call successors, (221), 87 states have call predecessors, (221), 85 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2022-04-27 13:52:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1153 transitions. [2022-04-27 13:52:02,694 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1153 transitions. Word has length 124 [2022-04-27 13:52:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:52:02,694 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1153 transitions. [2022-04-27 13:52:02,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 9 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 9 states have call predecessors, (35), 9 states have call successors, (35) [2022-04-27 13:52:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1153 transitions. [2022-04-27 13:52:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 13:52:02,696 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:52:02,696 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:52:02,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:52:02,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:52:02,922 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:52:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:52:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1372095454, now seen corresponding path program 3 times [2022-04-27 13:52:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:52:02,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411783806] [2022-04-27 13:52:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:52:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:52:02,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:52:02,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526730148] [2022-04-27 13:52:02,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:52:02,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:52:02,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:52:02,943 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-27 13:52:02,963 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-27 13:52:03,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:52:03,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:52:03,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 13:52:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:52:03,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:52:09,949 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:52:15,550 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:52:23,878 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:52:24,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {33033#true} call ULTIMATE.init(); {33033#true} is VALID [2022-04-27 13:52:24,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {33033#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; {33033#true} is VALID [2022-04-27 13:52:24,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33033#true} {33033#true} #92#return; {33033#true} is VALID [2022-04-27 13:52:24,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {33033#true} call #t~ret7 := main(); {33033#true} is VALID [2022-04-27 13:52:24,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {33033#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; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,119 INFO L272 TraceCheckUtils]: 8: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,119 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,119 INFO L272 TraceCheckUtils]: 13: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,120 INFO L272 TraceCheckUtils]: 18: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,121 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,121 INFO L272 TraceCheckUtils]: 26: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,122 INFO L272 TraceCheckUtils]: 31: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,123 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,123 INFO L272 TraceCheckUtils]: 36: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,123 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,123 INFO L290 TraceCheckUtils]: 41: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,124 INFO L272 TraceCheckUtils]: 44: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,125 INFO L272 TraceCheckUtils]: 49: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,125 INFO L272 TraceCheckUtils]: 54: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,126 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {33053#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {33053#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,127 INFO L272 TraceCheckUtils]: 62: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #78#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,127 INFO L272 TraceCheckUtils]: 67: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,128 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #80#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,128 INFO L272 TraceCheckUtils]: 72: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,128 INFO L290 TraceCheckUtils]: 75: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,128 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #82#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {33053#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,129 INFO L272 TraceCheckUtils]: 80: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 82: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,129 INFO L290 TraceCheckUtils]: 83: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,130 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,130 INFO L272 TraceCheckUtils]: 85: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,130 INFO L290 TraceCheckUtils]: 86: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,130 INFO L290 TraceCheckUtils]: 87: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,130 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,131 INFO L290 TraceCheckUtils]: 90: Hoare triple {33053#(= 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); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,131 INFO L290 TraceCheckUtils]: 91: Hoare triple {33053#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,131 INFO L290 TraceCheckUtils]: 92: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 93: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,132 INFO L272 TraceCheckUtils]: 94: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 95: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 97: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #84#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,132 INFO L272 TraceCheckUtils]: 99: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {33033#true} ~cond := #in~cond; {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {33033#true} assume !(0 == ~cond); {33033#true} is VALID [2022-04-27 13:52:24,132 INFO L290 TraceCheckUtils]: 102: Hoare triple {33033#true} assume true; {33033#true} is VALID [2022-04-27 13:52:24,133 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {33033#true} {33053#(= main_~B~0 1)} #86#return; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,133 INFO L290 TraceCheckUtils]: 104: Hoare triple {33053#(= 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); {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,133 INFO L290 TraceCheckUtils]: 105: Hoare triple {33053#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {33053#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,134 INFO L290 TraceCheckUtils]: 107: Hoare triple {33053#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33053#(= main_~B~0 1)} is VALID [2022-04-27 13:52:24,134 INFO L272 TraceCheckUtils]: 108: Hoare triple {33053#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {33033#true} is VALID [2022-04-27 13:52:24,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:24,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:24,135 INFO L290 TraceCheckUtils]: 111: Hoare triple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:24,135 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} {33053#(= main_~B~0 1)} #84#return; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,135 INFO L272 TraceCheckUtils]: 113: Hoare triple {33377#(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)); {33033#true} is VALID [2022-04-27 13:52:24,136 INFO L290 TraceCheckUtils]: 114: Hoare triple {33033#true} ~cond := #in~cond; {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:24,136 INFO L290 TraceCheckUtils]: 115: Hoare triple {33366#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:24,136 INFO L290 TraceCheckUtils]: 116: Hoare triple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:24,137 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {33370#(not (= |__VERIFIER_assert_#in~cond| 0))} {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,139 INFO L290 TraceCheckUtils]: 118: Hoare triple {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~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); {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,140 INFO L290 TraceCheckUtils]: 119: Hoare triple {33393#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,140 INFO L290 TraceCheckUtils]: 120: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,140 INFO L290 TraceCheckUtils]: 121: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} assume !!(#t~post6 < 50);havoc #t~post6; {33377#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:52:24,141 INFO L272 TraceCheckUtils]: 122: Hoare triple {33377#(and (= main_~B~0 1) (= (+ (* 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)); {33409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:52:24,141 INFO L290 TraceCheckUtils]: 123: Hoare triple {33409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:24,142 INFO L290 TraceCheckUtils]: 124: Hoare triple {33413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33034#false} is VALID [2022-04-27 13:52:24,142 INFO L290 TraceCheckUtils]: 125: Hoare triple {33034#false} assume !false; {33034#false} is VALID [2022-04-27 13:52:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 145 proven. 2 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2022-04-27 13:52:24,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:52:50,457 WARN L855 $PredicateComparison]: unable to prove that (or (= c_main_~p~0 1) (let ((.cse9 (* c_main_~p~0 c_main_~B~0))) (let ((.cse4 (= (mod .cse9 2) 0)) (.cse10 (< .cse9 0))) (let ((.cse6 (= (mod c_main_~p~0 2) 0)) (.cse3 (not .cse10)) (.cse0 (and .cse10 (not .cse4))) (.cse1 (* (- 1) (div .cse9 2))) (.cse5 (div c_main_~p~0 2)) (.cse7 (< c_main_~p~0 0))) (and (or (let ((.cse2 (* (+ c_main_~q~0 .cse5) c_main_~B~0))) (and (or .cse0 (= (+ .cse1 c_main_~r~0 .cse2) c_main_~A~0)) (or .cse3 (= c_main_~A~0 (+ (- 1) .cse1 c_main_~r~0 .cse2)) .cse4))) (and (not .cse6) .cse7)) (or .cse6 (let ((.cse8 (* (+ c_main_~q~0 .cse5 1) c_main_~B~0))) (and (or .cse3 .cse4 (= c_main_~A~0 (+ (- 1) .cse1 .cse8 c_main_~r~0))) (or .cse0 (= c_main_~A~0 (+ .cse1 .cse8 c_main_~r~0))))) (not .cse7))))))) is different from true [2022-04-27 14:00:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:00:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411783806] [2022-04-27 14:00:38,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:00:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526730148] [2022-04-27 14:00:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526730148] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:00:38,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:00:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:00:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248822930] [2022-04-27 14:00:38,057 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:00:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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 126 [2022-04-27 14:00:38,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:00:38,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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-27 14:00:38,093 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-27 14:00:38,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:00:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:00:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:00:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=166, Unknown=1, NotChecked=26, Total=240 [2022-04-27 14:00:38,094 INFO L87 Difference]: Start difference. First operand 905 states and 1153 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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-27 14:00:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:39,041 INFO L93 Difference]: Finished difference Result 935 states and 1182 transitions. [2022-04-27 14:00:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:00:39,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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 126 [2022-04-27 14:00:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:00:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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-27 14:00:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 14:00:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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-27 14:00:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 14:00:39,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 14:00:39,088 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-27 14:00:39,142 INFO L225 Difference]: With dead ends: 935 [2022-04-27 14:00:39,142 INFO L226 Difference]: Without dead ends: 921 [2022-04-27 14:00:39,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=60, Invalid=215, Unknown=1, NotChecked=30, Total=306 [2022-04-27 14:00:39,143 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:00:39,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 90 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:00:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-04-27 14:00:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 695. [2022-04-27 14:00:39,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:00:39,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 14:00:39,667 INFO L74 IsIncluded]: Start isIncluded. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 14:00:39,668 INFO L87 Difference]: Start difference. First operand 921 states. Second operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 14:00:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:39,708 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-27 14:00:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-27 14:00:39,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:39,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:39,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) Second operand 921 states. [2022-04-27 14:00:39,713 INFO L87 Difference]: Start difference. First operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) Second operand 921 states. [2022-04-27 14:00:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:39,752 INFO L93 Difference]: Finished difference Result 921 states and 1162 transitions. [2022-04-27 14:00:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2022-04-27 14:00:39,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:39,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:39,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:00:39,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:00:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 468 states have (on average 1.1752136752136753) internal successors, (550), 470 states have internal predecessors, (550), 153 states have call successors, (153), 75 states have call predecessors, (153), 73 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 14:00:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 853 transitions. [2022-04-27 14:00:39,785 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 853 transitions. Word has length 126 [2022-04-27 14:00:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:00:39,785 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 853 transitions. [2022-04-27 14:00:39,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 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-27 14:00:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 853 transitions. [2022-04-27 14:00:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 14:00:39,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:00:39,787 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:00:39,813 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-27 14:00:40,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:40,001 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:00:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:00:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 388866286, now seen corresponding path program 3 times [2022-04-27 14:00:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:00:40,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897745495] [2022-04-27 14:00:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:00:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:00:40,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:00:40,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069217155] [2022-04-27 14:00:40,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:00:40,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:40,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:00:40,017 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-27 14:00:40,019 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-27 14:00:40,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:00:40,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:00:40,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:00:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:00:40,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:00:40,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {37542#true} call ULTIMATE.init(); {37542#true} is VALID [2022-04-27 14:00:40,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {37542#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; {37542#true} is VALID [2022-04-27 14:00:40,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37542#true} {37542#true} #92#return; {37542#true} is VALID [2022-04-27 14:00:40,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {37542#true} call #t~ret7 := main(); {37542#true} is VALID [2022-04-27 14:00:40,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {37542#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; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {37562#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,369 INFO L272 TraceCheckUtils]: 8: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #78#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #80#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,371 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #82#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {37562#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {37562#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,372 INFO L272 TraceCheckUtils]: 26: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #78#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,372 INFO L272 TraceCheckUtils]: 31: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,373 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #80#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,373 INFO L272 TraceCheckUtils]: 36: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,373 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #82#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {37562#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {37562#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,374 INFO L272 TraceCheckUtils]: 44: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,374 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #78#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,375 INFO L272 TraceCheckUtils]: 49: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #80#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,375 INFO L272 TraceCheckUtils]: 54: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,376 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #82#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {37562#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {37562#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,376 INFO L272 TraceCheckUtils]: 62: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #78#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,377 INFO L272 TraceCheckUtils]: 67: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,377 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #80#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,378 INFO L272 TraceCheckUtils]: 72: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,378 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #82#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {37562#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {37562#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,384 INFO L272 TraceCheckUtils]: 80: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,385 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #84#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,385 INFO L272 TraceCheckUtils]: 85: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,386 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #86#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {37562#(= 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); {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {37562#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {37562#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,387 INFO L272 TraceCheckUtils]: 94: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,388 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #84#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,388 INFO L272 TraceCheckUtils]: 99: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,389 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #86#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,389 INFO L290 TraceCheckUtils]: 104: Hoare triple {37562#(= 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); {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,389 INFO L290 TraceCheckUtils]: 105: Hoare triple {37562#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {37562#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {37562#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,390 INFO L272 TraceCheckUtils]: 108: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,390 INFO L290 TraceCheckUtils]: 111: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,395 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37542#true} {37562#(= main_~B~0 1)} #84#return; {37562#(= main_~B~0 1)} is VALID [2022-04-27 14:00:40,395 INFO L272 TraceCheckUtils]: 113: Hoare triple {37562#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,396 INFO L290 TraceCheckUtils]: 114: Hoare triple {37542#true} ~cond := #in~cond; {37890#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:00:40,396 INFO L290 TraceCheckUtils]: 115: Hoare triple {37890#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:00:40,396 INFO L290 TraceCheckUtils]: 116: Hoare triple {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:00:40,397 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} {37562#(= main_~B~0 1)} #86#return; {37901#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-27 14:00:40,397 INFO L290 TraceCheckUtils]: 118: Hoare triple {37901#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} assume !(1 != ~p~0); {37905#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 14:00:40,397 INFO L272 TraceCheckUtils]: 119: Hoare triple {37905#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:40,397 INFO L290 TraceCheckUtils]: 120: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:40,397 INFO L290 TraceCheckUtils]: 121: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:40,397 INFO L290 TraceCheckUtils]: 122: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:40,398 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37542#true} {37905#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} #88#return; {37905#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 14:00:40,398 INFO L272 TraceCheckUtils]: 124: Hoare triple {37905#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {37924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:00:40,399 INFO L290 TraceCheckUtils]: 125: Hoare triple {37924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:00:40,399 INFO L290 TraceCheckUtils]: 126: Hoare triple {37928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37543#false} is VALID [2022-04-27 14:00:40,399 INFO L290 TraceCheckUtils]: 127: Hoare triple {37543#false} assume !false; {37543#false} is VALID [2022-04-27 14:00:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-04-27 14:00:40,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:00:44,801 INFO L290 TraceCheckUtils]: 127: Hoare triple {37543#false} assume !false; {37543#false} is VALID [2022-04-27 14:00:44,802 INFO L290 TraceCheckUtils]: 126: Hoare triple {37928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37543#false} is VALID [2022-04-27 14:00:44,802 INFO L290 TraceCheckUtils]: 125: Hoare triple {37924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:00:44,802 INFO L272 TraceCheckUtils]: 124: Hoare triple {37944#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {37924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:00:44,803 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {37542#true} {37944#(= main_~B~0 main_~d~0)} #88#return; {37944#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 14:00:44,803 INFO L290 TraceCheckUtils]: 122: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,803 INFO L290 TraceCheckUtils]: 121: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,803 INFO L290 TraceCheckUtils]: 120: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,803 INFO L272 TraceCheckUtils]: 119: Hoare triple {37944#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,803 INFO L290 TraceCheckUtils]: 118: Hoare triple {37963#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {37944#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 14:00:44,804 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} {37542#true} #86#return; {37963#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 14:00:44,804 INFO L290 TraceCheckUtils]: 116: Hoare triple {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 115: Hoare triple {37976#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {37894#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 114: Hoare triple {37542#true} ~cond := #in~cond; {37976#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:00:44,805 INFO L272 TraceCheckUtils]: 113: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {37542#true} {37542#true} #84#return; {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L272 TraceCheckUtils]: 108: Hoare triple {37542#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,805 INFO L290 TraceCheckUtils]: 107: Hoare triple {37542#true} assume !!(#t~post6 < 50);havoc #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 106: Hoare triple {37542#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 105: Hoare triple {37542#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 104: Hoare triple {37542#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); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {37542#true} {37542#true} #86#return; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 102: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 101: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 100: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L272 TraceCheckUtils]: 99: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {37542#true} {37542#true} #84#return; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 97: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 96: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 95: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L272 TraceCheckUtils]: 94: Hoare triple {37542#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {37542#true} assume !!(#t~post6 < 50);havoc #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {37542#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 91: Hoare triple {37542#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 90: Hoare triple {37542#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); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {37542#true} {37542#true} #86#return; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,806 INFO L272 TraceCheckUtils]: 85: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {37542#true} {37542#true} #84#return; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 83: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L272 TraceCheckUtils]: 80: Hoare triple {37542#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 79: Hoare triple {37542#true} assume !!(#t~post6 < 50);havoc #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {37542#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {37542#true} assume !(~r~0 >= ~d~0); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {37542#true} {37542#true} #82#return; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L272 TraceCheckUtils]: 72: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37542#true} {37542#true} #80#return; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 69: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L272 TraceCheckUtils]: 67: Hoare triple {37542#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {37542#true} {37542#true} #78#return; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L272 TraceCheckUtils]: 62: Hoare triple {37542#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {37542#true} assume !!(#t~post5 < 50);havoc #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {37542#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {37542#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {37542#true} {37542#true} #82#return; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L272 TraceCheckUtils]: 54: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37542#true} {37542#true} #80#return; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L272 TraceCheckUtils]: 49: Hoare triple {37542#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {37542#true} {37542#true} #78#return; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L272 TraceCheckUtils]: 44: Hoare triple {37542#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {37542#true} assume !!(#t~post5 < 50);havoc #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {37542#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {37542#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {37542#true} {37542#true} #82#return; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L272 TraceCheckUtils]: 36: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37542#true} {37542#true} #80#return; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L272 TraceCheckUtils]: 31: Hoare triple {37542#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37542#true} {37542#true} #78#return; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,809 INFO L272 TraceCheckUtils]: 26: Hoare triple {37542#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {37542#true} assume !!(#t~post5 < 50);havoc #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {37542#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {37542#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {37542#true} {37542#true} #82#return; {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L272 TraceCheckUtils]: 18: Hoare triple {37542#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37542#true} {37542#true} #80#return; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L272 TraceCheckUtils]: 13: Hoare triple {37542#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37542#true} {37542#true} #78#return; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {37542#true} assume !(0 == ~cond); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {37542#true} ~cond := #in~cond; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L272 TraceCheckUtils]: 8: Hoare triple {37542#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {37542#true} assume !!(#t~post5 < 50);havoc #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {37542#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {37542#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; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {37542#true} call #t~ret7 := main(); {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37542#true} {37542#true} #92#return; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {37542#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; {37542#true} is VALID [2022-04-27 14:00:44,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {37542#true} call ULTIMATE.init(); {37542#true} is VALID [2022-04-27 14:00:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-04-27 14:00:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:00:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897745495] [2022-04-27 14:00:44,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:00:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069217155] [2022-04-27 14:00:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069217155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:00:44,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:00:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 14:00:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127086821] [2022-04-27 14:00:44,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:00:44,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2022-04-27 14:00:44,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:00:44,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 14:00:44,872 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-27 14:00:44,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:00:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:00:44,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:00:44,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:00:44,873 INFO L87 Difference]: Start difference. First operand 695 states and 853 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 14:00:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:45,767 INFO L93 Difference]: Finished difference Result 771 states and 912 transitions. [2022-04-27 14:00:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:00:45,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2022-04-27 14:00:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:00:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 14:00:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 14:00:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 14:00:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 14:00:45,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-27 14:00:45,818 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-27 14:00:45,846 INFO L225 Difference]: With dead ends: 771 [2022-04-27 14:00:45,846 INFO L226 Difference]: Without dead ends: 755 [2022-04-27 14:00:45,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:00:45,847 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:00:45,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:00:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-04-27 14:00:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 539. [2022-04-27 14:00:46,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:00:46,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 14:00:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 14:00:46,298 INFO L87 Difference]: Start difference. First operand 755 states. Second operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 14:00:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:46,323 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-27 14:00:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-27 14:00:46,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:46,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:46,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) Second operand 755 states. [2022-04-27 14:00:46,328 INFO L87 Difference]: Start difference. First operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) Second operand 755 states. [2022-04-27 14:00:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:46,353 INFO L93 Difference]: Finished difference Result 755 states and 872 transitions. [2022-04-27 14:00:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 872 transitions. [2022-04-27 14:00:46,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:46,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:46,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:00:46,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:00:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 362 states have (on average 1.1049723756906078) internal successors, (400), 373 states have internal predecessors, (400), 103 states have call successors, (103), 74 states have call predecessors, (103), 73 states have return successors, (101), 91 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 14:00:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 604 transitions. [2022-04-27 14:00:46,374 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 604 transitions. Word has length 128 [2022-04-27 14:00:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:00:46,374 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 604 transitions. [2022-04-27 14:00:46,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-27 14:00:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 604 transitions. [2022-04-27 14:00:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-27 14:00:46,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:00:46,377 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:00:46,401 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-27 14:00:46,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:46,591 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:00:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:00:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1492475124, now seen corresponding path program 2 times [2022-04-27 14:00:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:00:46,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156145775] [2022-04-27 14:00:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:00:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:00:46,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:00:46,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50431078] [2022-04-27 14:00:46,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:00:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:00:46,617 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-27 14:00:46,618 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-27 14:00:46,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:00:46,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:00:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 14:00:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:00:46,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:00:47,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {41601#true} call ULTIMATE.init(); {41601#true} is VALID [2022-04-27 14:00:47,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {41601#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; {41609#(<= ~counter~0 0)} is VALID [2022-04-27 14:00:47,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {41609#(<= ~counter~0 0)} assume true; {41609#(<= ~counter~0 0)} is VALID [2022-04-27 14:00:47,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41609#(<= ~counter~0 0)} {41601#true} #92#return; {41609#(<= ~counter~0 0)} is VALID [2022-04-27 14:00:47,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {41609#(<= ~counter~0 0)} call #t~ret7 := main(); {41609#(<= ~counter~0 0)} is VALID [2022-04-27 14:00:47,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {41609#(<= ~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; {41609#(<= ~counter~0 0)} is VALID [2022-04-27 14:00:47,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {41609#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {41625#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,731 INFO L272 TraceCheckUtils]: 8: Hoare triple {41625#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {41625#(<= ~counter~0 1)} ~cond := #in~cond; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {41625#(<= ~counter~0 1)} assume !(0 == ~cond); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {41625#(<= ~counter~0 1)} assume true; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,732 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41625#(<= ~counter~0 1)} {41625#(<= ~counter~0 1)} #78#return; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {41625#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {41625#(<= ~counter~0 1)} ~cond := #in~cond; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {41625#(<= ~counter~0 1)} assume !(0 == ~cond); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {41625#(<= ~counter~0 1)} assume true; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,737 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41625#(<= ~counter~0 1)} {41625#(<= ~counter~0 1)} #80#return; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {41625#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {41625#(<= ~counter~0 1)} ~cond := #in~cond; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {41625#(<= ~counter~0 1)} assume !(0 == ~cond); {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {41625#(<= ~counter~0 1)} assume true; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,738 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41625#(<= ~counter~0 1)} {41625#(<= ~counter~0 1)} #82#return; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {41625#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41625#(<= ~counter~0 1)} is VALID [2022-04-27 14:00:47,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {41625#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {41680#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,740 INFO L272 TraceCheckUtils]: 26: Hoare triple {41680#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {41680#(<= ~counter~0 2)} ~cond := #in~cond; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {41680#(<= ~counter~0 2)} assume !(0 == ~cond); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {41680#(<= ~counter~0 2)} assume true; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,741 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41680#(<= ~counter~0 2)} {41680#(<= ~counter~0 2)} #78#return; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,742 INFO L272 TraceCheckUtils]: 31: Hoare triple {41680#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {41680#(<= ~counter~0 2)} ~cond := #in~cond; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {41680#(<= ~counter~0 2)} assume !(0 == ~cond); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {41680#(<= ~counter~0 2)} assume true; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,743 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41680#(<= ~counter~0 2)} {41680#(<= ~counter~0 2)} #80#return; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,743 INFO L272 TraceCheckUtils]: 36: Hoare triple {41680#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {41680#(<= ~counter~0 2)} ~cond := #in~cond; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {41680#(<= ~counter~0 2)} assume !(0 == ~cond); {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {41680#(<= ~counter~0 2)} assume true; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,744 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41680#(<= ~counter~0 2)} {41680#(<= ~counter~0 2)} #82#return; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,745 INFO L290 TraceCheckUtils]: 41: Hoare triple {41680#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41680#(<= ~counter~0 2)} is VALID [2022-04-27 14:00:47,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {41680#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {41735#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,746 INFO L272 TraceCheckUtils]: 44: Hoare triple {41735#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {41735#(<= ~counter~0 3)} ~cond := #in~cond; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {41735#(<= ~counter~0 3)} assume !(0 == ~cond); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {41735#(<= ~counter~0 3)} assume true; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,747 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41735#(<= ~counter~0 3)} {41735#(<= ~counter~0 3)} #78#return; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,747 INFO L272 TraceCheckUtils]: 49: Hoare triple {41735#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {41735#(<= ~counter~0 3)} ~cond := #in~cond; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {41735#(<= ~counter~0 3)} assume !(0 == ~cond); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {41735#(<= ~counter~0 3)} assume true; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,748 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41735#(<= ~counter~0 3)} {41735#(<= ~counter~0 3)} #80#return; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,749 INFO L272 TraceCheckUtils]: 54: Hoare triple {41735#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {41735#(<= ~counter~0 3)} ~cond := #in~cond; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {41735#(<= ~counter~0 3)} assume !(0 == ~cond); {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {41735#(<= ~counter~0 3)} assume true; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,750 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41735#(<= ~counter~0 3)} {41735#(<= ~counter~0 3)} #82#return; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {41735#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {41735#(<= ~counter~0 3)} is VALID [2022-04-27 14:00:47,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {41735#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {41790#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,751 INFO L272 TraceCheckUtils]: 62: Hoare triple {41790#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {41790#(<= ~counter~0 4)} ~cond := #in~cond; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,752 INFO L290 TraceCheckUtils]: 64: Hoare triple {41790#(<= ~counter~0 4)} assume !(0 == ~cond); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {41790#(<= ~counter~0 4)} assume true; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,752 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41790#(<= ~counter~0 4)} {41790#(<= ~counter~0 4)} #78#return; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,753 INFO L272 TraceCheckUtils]: 67: Hoare triple {41790#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {41790#(<= ~counter~0 4)} ~cond := #in~cond; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {41790#(<= ~counter~0 4)} assume !(0 == ~cond); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {41790#(<= ~counter~0 4)} assume true; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,754 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41790#(<= ~counter~0 4)} {41790#(<= ~counter~0 4)} #80#return; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,754 INFO L272 TraceCheckUtils]: 72: Hoare triple {41790#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,755 INFO L290 TraceCheckUtils]: 73: Hoare triple {41790#(<= ~counter~0 4)} ~cond := #in~cond; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,755 INFO L290 TraceCheckUtils]: 74: Hoare triple {41790#(<= ~counter~0 4)} assume !(0 == ~cond); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {41790#(<= ~counter~0 4)} assume true; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,756 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41790#(<= ~counter~0 4)} {41790#(<= ~counter~0 4)} #82#return; {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {41790#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {41790#(<= ~counter~0 4)} is VALID [2022-04-27 14:00:47,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {41790#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,757 INFO L290 TraceCheckUtils]: 79: Hoare triple {41845#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,757 INFO L272 TraceCheckUtils]: 80: Hoare triple {41845#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,770 INFO L290 TraceCheckUtils]: 81: Hoare triple {41845#(<= ~counter~0 5)} ~cond := #in~cond; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {41845#(<= ~counter~0 5)} assume !(0 == ~cond); {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,771 INFO L290 TraceCheckUtils]: 83: Hoare triple {41845#(<= ~counter~0 5)} assume true; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,772 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41845#(<= ~counter~0 5)} {41845#(<= ~counter~0 5)} #84#return; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,772 INFO L272 TraceCheckUtils]: 85: Hoare triple {41845#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {41845#(<= ~counter~0 5)} ~cond := #in~cond; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {41845#(<= ~counter~0 5)} assume !(0 == ~cond); {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {41845#(<= ~counter~0 5)} assume true; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,774 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41845#(<= ~counter~0 5)} {41845#(<= ~counter~0 5)} #86#return; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,774 INFO L290 TraceCheckUtils]: 90: Hoare triple {41845#(<= ~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); {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,774 INFO L290 TraceCheckUtils]: 91: Hoare triple {41845#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41845#(<= ~counter~0 5)} is VALID [2022-04-27 14:00:47,775 INFO L290 TraceCheckUtils]: 92: Hoare triple {41845#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {41888#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,776 INFO L272 TraceCheckUtils]: 94: Hoare triple {41888#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {41888#(<= ~counter~0 6)} ~cond := #in~cond; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {41888#(<= ~counter~0 6)} assume !(0 == ~cond); {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {41888#(<= ~counter~0 6)} assume true; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,777 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41888#(<= ~counter~0 6)} {41888#(<= ~counter~0 6)} #84#return; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,778 INFO L272 TraceCheckUtils]: 99: Hoare triple {41888#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {41888#(<= ~counter~0 6)} ~cond := #in~cond; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {41888#(<= ~counter~0 6)} assume !(0 == ~cond); {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {41888#(<= ~counter~0 6)} assume true; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,779 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41888#(<= ~counter~0 6)} {41888#(<= ~counter~0 6)} #86#return; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {41888#(<= ~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); {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {41888#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41888#(<= ~counter~0 6)} is VALID [2022-04-27 14:00:47,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {41888#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,780 INFO L290 TraceCheckUtils]: 107: Hoare triple {41931#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,781 INFO L272 TraceCheckUtils]: 108: Hoare triple {41931#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,781 INFO L290 TraceCheckUtils]: 109: Hoare triple {41931#(<= ~counter~0 7)} ~cond := #in~cond; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,781 INFO L290 TraceCheckUtils]: 110: Hoare triple {41931#(<= ~counter~0 7)} assume !(0 == ~cond); {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {41931#(<= ~counter~0 7)} assume true; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,782 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41931#(<= ~counter~0 7)} {41931#(<= ~counter~0 7)} #84#return; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,782 INFO L272 TraceCheckUtils]: 113: Hoare triple {41931#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {41931#(<= ~counter~0 7)} ~cond := #in~cond; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {41931#(<= ~counter~0 7)} assume !(0 == ~cond); {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {41931#(<= ~counter~0 7)} assume true; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,783 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41931#(<= ~counter~0 7)} {41931#(<= ~counter~0 7)} #86#return; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {41931#(<= ~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); {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {41931#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41931#(<= ~counter~0 7)} is VALID [2022-04-27 14:00:47,785 INFO L290 TraceCheckUtils]: 120: Hoare triple {41931#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,785 INFO L290 TraceCheckUtils]: 121: Hoare triple {41974#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,785 INFO L272 TraceCheckUtils]: 122: Hoare triple {41974#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {41974#(<= ~counter~0 8)} ~cond := #in~cond; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,786 INFO L290 TraceCheckUtils]: 124: Hoare triple {41974#(<= ~counter~0 8)} assume !(0 == ~cond); {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,786 INFO L290 TraceCheckUtils]: 125: Hoare triple {41974#(<= ~counter~0 8)} assume true; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,786 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41974#(<= ~counter~0 8)} {41974#(<= ~counter~0 8)} #84#return; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,787 INFO L272 TraceCheckUtils]: 127: Hoare triple {41974#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,787 INFO L290 TraceCheckUtils]: 128: Hoare triple {41974#(<= ~counter~0 8)} ~cond := #in~cond; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,787 INFO L290 TraceCheckUtils]: 129: Hoare triple {41974#(<= ~counter~0 8)} assume !(0 == ~cond); {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,788 INFO L290 TraceCheckUtils]: 130: Hoare triple {41974#(<= ~counter~0 8)} assume true; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,788 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41974#(<= ~counter~0 8)} {41974#(<= ~counter~0 8)} #86#return; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,788 INFO L290 TraceCheckUtils]: 132: Hoare triple {41974#(<= ~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); {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,789 INFO L290 TraceCheckUtils]: 133: Hoare triple {41974#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {41974#(<= ~counter~0 8)} is VALID [2022-04-27 14:00:47,789 INFO L290 TraceCheckUtils]: 134: Hoare triple {41974#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,789 INFO L290 TraceCheckUtils]: 135: Hoare triple {42017#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,790 INFO L272 TraceCheckUtils]: 136: Hoare triple {42017#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,790 INFO L290 TraceCheckUtils]: 137: Hoare triple {42017#(<= ~counter~0 9)} ~cond := #in~cond; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,790 INFO L290 TraceCheckUtils]: 138: Hoare triple {42017#(<= ~counter~0 9)} assume !(0 == ~cond); {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,790 INFO L290 TraceCheckUtils]: 139: Hoare triple {42017#(<= ~counter~0 9)} assume true; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,791 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {42017#(<= ~counter~0 9)} {42017#(<= ~counter~0 9)} #84#return; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,791 INFO L272 TraceCheckUtils]: 141: Hoare triple {42017#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,792 INFO L290 TraceCheckUtils]: 142: Hoare triple {42017#(<= ~counter~0 9)} ~cond := #in~cond; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,792 INFO L290 TraceCheckUtils]: 143: Hoare triple {42017#(<= ~counter~0 9)} assume !(0 == ~cond); {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,792 INFO L290 TraceCheckUtils]: 144: Hoare triple {42017#(<= ~counter~0 9)} assume true; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,792 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {42017#(<= ~counter~0 9)} {42017#(<= ~counter~0 9)} #86#return; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,793 INFO L290 TraceCheckUtils]: 146: Hoare triple {42017#(<= ~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); {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,793 INFO L290 TraceCheckUtils]: 147: Hoare triple {42017#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42017#(<= ~counter~0 9)} is VALID [2022-04-27 14:00:47,793 INFO L290 TraceCheckUtils]: 148: Hoare triple {42017#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,794 INFO L290 TraceCheckUtils]: 149: Hoare triple {42060#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,794 INFO L272 TraceCheckUtils]: 150: Hoare triple {42060#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,794 INFO L290 TraceCheckUtils]: 151: Hoare triple {42060#(<= ~counter~0 10)} ~cond := #in~cond; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,795 INFO L290 TraceCheckUtils]: 152: Hoare triple {42060#(<= ~counter~0 10)} assume !(0 == ~cond); {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,795 INFO L290 TraceCheckUtils]: 153: Hoare triple {42060#(<= ~counter~0 10)} assume true; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,795 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {42060#(<= ~counter~0 10)} {42060#(<= ~counter~0 10)} #84#return; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,796 INFO L272 TraceCheckUtils]: 155: Hoare triple {42060#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,796 INFO L290 TraceCheckUtils]: 156: Hoare triple {42060#(<= ~counter~0 10)} ~cond := #in~cond; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,796 INFO L290 TraceCheckUtils]: 157: Hoare triple {42060#(<= ~counter~0 10)} assume !(0 == ~cond); {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,797 INFO L290 TraceCheckUtils]: 158: Hoare triple {42060#(<= ~counter~0 10)} assume true; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,797 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42060#(<= ~counter~0 10)} {42060#(<= ~counter~0 10)} #86#return; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,797 INFO L290 TraceCheckUtils]: 160: Hoare triple {42060#(<= ~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); {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,798 INFO L290 TraceCheckUtils]: 161: Hoare triple {42060#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42060#(<= ~counter~0 10)} is VALID [2022-04-27 14:00:47,798 INFO L290 TraceCheckUtils]: 162: Hoare triple {42060#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,798 INFO L290 TraceCheckUtils]: 163: Hoare triple {42103#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,799 INFO L272 TraceCheckUtils]: 164: Hoare triple {42103#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,799 INFO L290 TraceCheckUtils]: 165: Hoare triple {42103#(<= ~counter~0 11)} ~cond := #in~cond; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,800 INFO L290 TraceCheckUtils]: 166: Hoare triple {42103#(<= ~counter~0 11)} assume !(0 == ~cond); {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,800 INFO L290 TraceCheckUtils]: 167: Hoare triple {42103#(<= ~counter~0 11)} assume true; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,801 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {42103#(<= ~counter~0 11)} {42103#(<= ~counter~0 11)} #84#return; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,801 INFO L272 TraceCheckUtils]: 169: Hoare triple {42103#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,801 INFO L290 TraceCheckUtils]: 170: Hoare triple {42103#(<= ~counter~0 11)} ~cond := #in~cond; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,802 INFO L290 TraceCheckUtils]: 171: Hoare triple {42103#(<= ~counter~0 11)} assume !(0 == ~cond); {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,802 INFO L290 TraceCheckUtils]: 172: Hoare triple {42103#(<= ~counter~0 11)} assume true; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,803 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {42103#(<= ~counter~0 11)} {42103#(<= ~counter~0 11)} #86#return; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,803 INFO L290 TraceCheckUtils]: 174: Hoare triple {42103#(<= ~counter~0 11)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,803 INFO L290 TraceCheckUtils]: 175: Hoare triple {42103#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42103#(<= ~counter~0 11)} is VALID [2022-04-27 14:00:47,804 INFO L290 TraceCheckUtils]: 176: Hoare triple {42103#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,804 INFO L290 TraceCheckUtils]: 177: Hoare triple {42146#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,805 INFO L272 TraceCheckUtils]: 178: Hoare triple {42146#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,805 INFO L290 TraceCheckUtils]: 179: Hoare triple {42146#(<= ~counter~0 12)} ~cond := #in~cond; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,805 INFO L290 TraceCheckUtils]: 180: Hoare triple {42146#(<= ~counter~0 12)} assume !(0 == ~cond); {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,805 INFO L290 TraceCheckUtils]: 181: Hoare triple {42146#(<= ~counter~0 12)} assume true; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,806 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {42146#(<= ~counter~0 12)} {42146#(<= ~counter~0 12)} #84#return; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,806 INFO L272 TraceCheckUtils]: 183: Hoare triple {42146#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,807 INFO L290 TraceCheckUtils]: 184: Hoare triple {42146#(<= ~counter~0 12)} ~cond := #in~cond; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,807 INFO L290 TraceCheckUtils]: 185: Hoare triple {42146#(<= ~counter~0 12)} assume !(0 == ~cond); {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,807 INFO L290 TraceCheckUtils]: 186: Hoare triple {42146#(<= ~counter~0 12)} assume true; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,808 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {42146#(<= ~counter~0 12)} {42146#(<= ~counter~0 12)} #86#return; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,808 INFO L290 TraceCheckUtils]: 188: Hoare triple {42146#(<= ~counter~0 12)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,808 INFO L290 TraceCheckUtils]: 189: Hoare triple {42146#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42146#(<= ~counter~0 12)} is VALID [2022-04-27 14:00:47,809 INFO L290 TraceCheckUtils]: 190: Hoare triple {42146#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,809 INFO L290 TraceCheckUtils]: 191: Hoare triple {42189#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,809 INFO L272 TraceCheckUtils]: 192: Hoare triple {42189#(<= ~counter~0 13)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,809 INFO L290 TraceCheckUtils]: 193: Hoare triple {42189#(<= ~counter~0 13)} ~cond := #in~cond; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,810 INFO L290 TraceCheckUtils]: 194: Hoare triple {42189#(<= ~counter~0 13)} assume !(0 == ~cond); {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,810 INFO L290 TraceCheckUtils]: 195: Hoare triple {42189#(<= ~counter~0 13)} assume true; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,810 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {42189#(<= ~counter~0 13)} {42189#(<= ~counter~0 13)} #84#return; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,811 INFO L272 TraceCheckUtils]: 197: Hoare triple {42189#(<= ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,811 INFO L290 TraceCheckUtils]: 198: Hoare triple {42189#(<= ~counter~0 13)} ~cond := #in~cond; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,811 INFO L290 TraceCheckUtils]: 199: Hoare triple {42189#(<= ~counter~0 13)} assume !(0 == ~cond); {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,812 INFO L290 TraceCheckUtils]: 200: Hoare triple {42189#(<= ~counter~0 13)} assume true; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,812 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {42189#(<= ~counter~0 13)} {42189#(<= ~counter~0 13)} #86#return; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,812 INFO L290 TraceCheckUtils]: 202: Hoare triple {42189#(<= ~counter~0 13)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,812 INFO L290 TraceCheckUtils]: 203: Hoare triple {42189#(<= ~counter~0 13)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42189#(<= ~counter~0 13)} is VALID [2022-04-27 14:00:47,813 INFO L290 TraceCheckUtils]: 204: Hoare triple {42189#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,813 INFO L290 TraceCheckUtils]: 205: Hoare triple {42232#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,814 INFO L272 TraceCheckUtils]: 206: Hoare triple {42232#(<= ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,814 INFO L290 TraceCheckUtils]: 207: Hoare triple {42232#(<= ~counter~0 14)} ~cond := #in~cond; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,814 INFO L290 TraceCheckUtils]: 208: Hoare triple {42232#(<= ~counter~0 14)} assume !(0 == ~cond); {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,814 INFO L290 TraceCheckUtils]: 209: Hoare triple {42232#(<= ~counter~0 14)} assume true; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,815 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {42232#(<= ~counter~0 14)} {42232#(<= ~counter~0 14)} #84#return; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,816 INFO L272 TraceCheckUtils]: 211: Hoare triple {42232#(<= ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,816 INFO L290 TraceCheckUtils]: 212: Hoare triple {42232#(<= ~counter~0 14)} ~cond := #in~cond; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,816 INFO L290 TraceCheckUtils]: 213: Hoare triple {42232#(<= ~counter~0 14)} assume !(0 == ~cond); {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,816 INFO L290 TraceCheckUtils]: 214: Hoare triple {42232#(<= ~counter~0 14)} assume true; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,817 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {42232#(<= ~counter~0 14)} {42232#(<= ~counter~0 14)} #86#return; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,817 INFO L290 TraceCheckUtils]: 216: Hoare triple {42232#(<= ~counter~0 14)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,817 INFO L290 TraceCheckUtils]: 217: Hoare triple {42232#(<= ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42232#(<= ~counter~0 14)} is VALID [2022-04-27 14:00:47,818 INFO L290 TraceCheckUtils]: 218: Hoare triple {42232#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42275#(<= |main_#t~post6| 14)} is VALID [2022-04-27 14:00:47,818 INFO L290 TraceCheckUtils]: 219: Hoare triple {42275#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {41602#false} is VALID [2022-04-27 14:00:47,818 INFO L272 TraceCheckUtils]: 220: Hoare triple {41602#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41602#false} is VALID [2022-04-27 14:00:47,818 INFO L290 TraceCheckUtils]: 221: Hoare triple {41602#false} ~cond := #in~cond; {41602#false} is VALID [2022-04-27 14:00:47,818 INFO L290 TraceCheckUtils]: 222: Hoare triple {41602#false} assume 0 == ~cond; {41602#false} is VALID [2022-04-27 14:00:47,818 INFO L290 TraceCheckUtils]: 223: Hoare triple {41602#false} assume !false; {41602#false} is VALID [2022-04-27 14:00:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 64 proven. 2222 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 14:00:47,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:00:48,854 INFO L290 TraceCheckUtils]: 223: Hoare triple {41602#false} assume !false; {41602#false} is VALID [2022-04-27 14:00:48,854 INFO L290 TraceCheckUtils]: 222: Hoare triple {41602#false} assume 0 == ~cond; {41602#false} is VALID [2022-04-27 14:00:48,854 INFO L290 TraceCheckUtils]: 221: Hoare triple {41602#false} ~cond := #in~cond; {41602#false} is VALID [2022-04-27 14:00:48,854 INFO L272 TraceCheckUtils]: 220: Hoare triple {41602#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41602#false} is VALID [2022-04-27 14:00:48,854 INFO L290 TraceCheckUtils]: 219: Hoare triple {42303#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {41602#false} is VALID [2022-04-27 14:00:48,855 INFO L290 TraceCheckUtils]: 218: Hoare triple {42307#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42303#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:00:48,855 INFO L290 TraceCheckUtils]: 217: Hoare triple {42307#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,855 INFO L290 TraceCheckUtils]: 216: Hoare triple {42307#(< ~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); {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,855 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {41601#true} {42307#(< ~counter~0 50)} #86#return; {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 214: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 213: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 212: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L272 TraceCheckUtils]: 211: Hoare triple {42307#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {41601#true} {42307#(< ~counter~0 50)} #84#return; {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 209: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 208: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L290 TraceCheckUtils]: 207: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,856 INFO L272 TraceCheckUtils]: 206: Hoare triple {42307#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,857 INFO L290 TraceCheckUtils]: 205: Hoare triple {42307#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,857 INFO L290 TraceCheckUtils]: 204: Hoare triple {42350#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42307#(< ~counter~0 50)} is VALID [2022-04-27 14:00:48,858 INFO L290 TraceCheckUtils]: 203: Hoare triple {42350#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,858 INFO L290 TraceCheckUtils]: 202: Hoare triple {42350#(< ~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); {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,858 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {41601#true} {42350#(< ~counter~0 49)} #86#return; {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,858 INFO L290 TraceCheckUtils]: 200: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,858 INFO L290 TraceCheckUtils]: 199: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,858 INFO L290 TraceCheckUtils]: 198: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,858 INFO L272 TraceCheckUtils]: 197: Hoare triple {42350#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,859 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {41601#true} {42350#(< ~counter~0 49)} #84#return; {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,859 INFO L290 TraceCheckUtils]: 195: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,859 INFO L290 TraceCheckUtils]: 194: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,859 INFO L290 TraceCheckUtils]: 193: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,859 INFO L272 TraceCheckUtils]: 192: Hoare triple {42350#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,859 INFO L290 TraceCheckUtils]: 191: Hoare triple {42350#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,860 INFO L290 TraceCheckUtils]: 190: Hoare triple {42393#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42350#(< ~counter~0 49)} is VALID [2022-04-27 14:00:48,860 INFO L290 TraceCheckUtils]: 189: Hoare triple {42393#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,860 INFO L290 TraceCheckUtils]: 188: Hoare triple {42393#(< ~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); {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,861 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {41601#true} {42393#(< ~counter~0 48)} #86#return; {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,861 INFO L290 TraceCheckUtils]: 186: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,861 INFO L290 TraceCheckUtils]: 185: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,861 INFO L290 TraceCheckUtils]: 184: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,861 INFO L272 TraceCheckUtils]: 183: Hoare triple {42393#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,861 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {41601#true} {42393#(< ~counter~0 48)} #84#return; {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,862 INFO L290 TraceCheckUtils]: 181: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,862 INFO L290 TraceCheckUtils]: 180: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,862 INFO L290 TraceCheckUtils]: 179: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,862 INFO L272 TraceCheckUtils]: 178: Hoare triple {42393#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,876 INFO L290 TraceCheckUtils]: 177: Hoare triple {42393#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,877 INFO L290 TraceCheckUtils]: 176: Hoare triple {42436#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42393#(< ~counter~0 48)} is VALID [2022-04-27 14:00:48,877 INFO L290 TraceCheckUtils]: 175: Hoare triple {42436#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,878 INFO L290 TraceCheckUtils]: 174: Hoare triple {42436#(< ~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); {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,878 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {41601#true} {42436#(< ~counter~0 47)} #86#return; {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,878 INFO L290 TraceCheckUtils]: 172: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,878 INFO L290 TraceCheckUtils]: 171: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,878 INFO L290 TraceCheckUtils]: 170: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,878 INFO L272 TraceCheckUtils]: 169: Hoare triple {42436#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,879 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {41601#true} {42436#(< ~counter~0 47)} #84#return; {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,879 INFO L290 TraceCheckUtils]: 167: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,879 INFO L290 TraceCheckUtils]: 166: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,879 INFO L290 TraceCheckUtils]: 165: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,879 INFO L272 TraceCheckUtils]: 164: Hoare triple {42436#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,879 INFO L290 TraceCheckUtils]: 163: Hoare triple {42436#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,880 INFO L290 TraceCheckUtils]: 162: Hoare triple {42479#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42436#(< ~counter~0 47)} is VALID [2022-04-27 14:00:48,880 INFO L290 TraceCheckUtils]: 161: Hoare triple {42479#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,880 INFO L290 TraceCheckUtils]: 160: Hoare triple {42479#(< ~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); {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,881 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {41601#true} {42479#(< ~counter~0 46)} #86#return; {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,881 INFO L290 TraceCheckUtils]: 158: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,881 INFO L290 TraceCheckUtils]: 157: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,881 INFO L290 TraceCheckUtils]: 156: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,881 INFO L272 TraceCheckUtils]: 155: Hoare triple {42479#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,881 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {41601#true} {42479#(< ~counter~0 46)} #84#return; {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,881 INFO L290 TraceCheckUtils]: 153: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,881 INFO L290 TraceCheckUtils]: 152: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,882 INFO L290 TraceCheckUtils]: 151: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,882 INFO L272 TraceCheckUtils]: 150: Hoare triple {42479#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,882 INFO L290 TraceCheckUtils]: 149: Hoare triple {42479#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,882 INFO L290 TraceCheckUtils]: 148: Hoare triple {42522#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42479#(< ~counter~0 46)} is VALID [2022-04-27 14:00:48,883 INFO L290 TraceCheckUtils]: 147: Hoare triple {42522#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,883 INFO L290 TraceCheckUtils]: 146: Hoare triple {42522#(< ~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); {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,883 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {41601#true} {42522#(< ~counter~0 45)} #86#return; {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,883 INFO L290 TraceCheckUtils]: 144: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,883 INFO L290 TraceCheckUtils]: 143: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,883 INFO L290 TraceCheckUtils]: 142: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,883 INFO L272 TraceCheckUtils]: 141: Hoare triple {42522#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,884 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41601#true} {42522#(< ~counter~0 45)} #84#return; {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,884 INFO L290 TraceCheckUtils]: 139: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,884 INFO L290 TraceCheckUtils]: 138: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,884 INFO L290 TraceCheckUtils]: 137: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,884 INFO L272 TraceCheckUtils]: 136: Hoare triple {42522#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,884 INFO L290 TraceCheckUtils]: 135: Hoare triple {42522#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,885 INFO L290 TraceCheckUtils]: 134: Hoare triple {42565#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42522#(< ~counter~0 45)} is VALID [2022-04-27 14:00:48,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {42565#(< ~counter~0 44)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,885 INFO L290 TraceCheckUtils]: 132: Hoare triple {42565#(< ~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); {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,886 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {41601#true} {42565#(< ~counter~0 44)} #86#return; {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 130: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 129: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 128: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L272 TraceCheckUtils]: 127: Hoare triple {42565#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {41601#true} {42565#(< ~counter~0 44)} #84#return; {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 125: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 124: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,886 INFO L290 TraceCheckUtils]: 123: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,887 INFO L272 TraceCheckUtils]: 122: Hoare triple {42565#(< ~counter~0 44)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {42565#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {42608#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42565#(< ~counter~0 44)} is VALID [2022-04-27 14:00:48,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {42608#(< ~counter~0 43)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,888 INFO L290 TraceCheckUtils]: 118: Hoare triple {42608#(< ~counter~0 43)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,888 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {41601#true} {42608#(< ~counter~0 43)} #86#return; {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,888 INFO L290 TraceCheckUtils]: 116: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,888 INFO L290 TraceCheckUtils]: 115: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,888 INFO L290 TraceCheckUtils]: 114: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,888 INFO L272 TraceCheckUtils]: 113: Hoare triple {42608#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,889 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {41601#true} {42608#(< ~counter~0 43)} #84#return; {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,889 INFO L290 TraceCheckUtils]: 111: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,889 INFO L290 TraceCheckUtils]: 110: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,889 INFO L290 TraceCheckUtils]: 109: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,889 INFO L272 TraceCheckUtils]: 108: Hoare triple {42608#(< ~counter~0 43)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,889 INFO L290 TraceCheckUtils]: 107: Hoare triple {42608#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,890 INFO L290 TraceCheckUtils]: 106: Hoare triple {42651#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42608#(< ~counter~0 43)} is VALID [2022-04-27 14:00:48,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {42651#(< ~counter~0 42)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,890 INFO L290 TraceCheckUtils]: 104: Hoare triple {42651#(< ~counter~0 42)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,891 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41601#true} {42651#(< ~counter~0 42)} #86#return; {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 102: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 101: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 100: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L272 TraceCheckUtils]: 99: Hoare triple {42651#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {41601#true} {42651#(< ~counter~0 42)} #84#return; {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 97: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 96: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,891 INFO L290 TraceCheckUtils]: 95: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,892 INFO L272 TraceCheckUtils]: 94: Hoare triple {42651#(< ~counter~0 42)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {42651#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,892 INFO L290 TraceCheckUtils]: 92: Hoare triple {42694#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42651#(< ~counter~0 42)} is VALID [2022-04-27 14:00:48,892 INFO L290 TraceCheckUtils]: 91: Hoare triple {42694#(< ~counter~0 41)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,893 INFO L290 TraceCheckUtils]: 90: Hoare triple {42694#(< ~counter~0 41)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,893 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {41601#true} {42694#(< ~counter~0 41)} #86#return; {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,893 INFO L290 TraceCheckUtils]: 88: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,893 INFO L290 TraceCheckUtils]: 87: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,893 INFO L290 TraceCheckUtils]: 86: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,893 INFO L272 TraceCheckUtils]: 85: Hoare triple {42694#(< ~counter~0 41)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,894 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {41601#true} {42694#(< ~counter~0 41)} #84#return; {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,894 INFO L290 TraceCheckUtils]: 81: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,894 INFO L272 TraceCheckUtils]: 80: Hoare triple {42694#(< ~counter~0 41)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {42694#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {42737#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42694#(< ~counter~0 41)} is VALID [2022-04-27 14:00:48,895 INFO L290 TraceCheckUtils]: 77: Hoare triple {42737#(< ~counter~0 40)} assume !(~r~0 >= ~d~0); {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,895 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {41601#true} {42737#(< ~counter~0 40)} #82#return; {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 74: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 73: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L272 TraceCheckUtils]: 72: Hoare triple {42737#(< ~counter~0 40)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41601#true} {42737#(< ~counter~0 40)} #80#return; {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,896 INFO L272 TraceCheckUtils]: 67: Hoare triple {42737#(< ~counter~0 40)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,897 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {41601#true} {42737#(< ~counter~0 40)} #78#return; {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,897 INFO L272 TraceCheckUtils]: 62: Hoare triple {42737#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {42737#(< ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {42792#(< ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42737#(< ~counter~0 40)} is VALID [2022-04-27 14:00:48,898 INFO L290 TraceCheckUtils]: 59: Hoare triple {42792#(< ~counter~0 39)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,898 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {41601#true} {42792#(< ~counter~0 39)} #82#return; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,898 INFO L272 TraceCheckUtils]: 54: Hoare triple {42792#(< ~counter~0 39)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41601#true} {42792#(< ~counter~0 39)} #80#return; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L272 TraceCheckUtils]: 49: Hoare triple {42792#(< ~counter~0 39)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {41601#true} {42792#(< ~counter~0 39)} #78#return; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,899 INFO L272 TraceCheckUtils]: 44: Hoare triple {42792#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {42792#(< ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {42847#(< ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42792#(< ~counter~0 39)} is VALID [2022-04-27 14:00:48,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {42847#(< ~counter~0 38)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,901 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41601#true} {42847#(< ~counter~0 38)} #82#return; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,901 INFO L272 TraceCheckUtils]: 36: Hoare triple {42847#(< ~counter~0 38)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,901 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41601#true} {42847#(< ~counter~0 38)} #80#return; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L272 TraceCheckUtils]: 31: Hoare triple {42847#(< ~counter~0 38)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {41601#true} {42847#(< ~counter~0 38)} #78#return; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L272 TraceCheckUtils]: 26: Hoare triple {42847#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {42847#(< ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {42902#(< ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42847#(< ~counter~0 38)} is VALID [2022-04-27 14:00:48,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {42902#(< ~counter~0 37)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,904 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41601#true} {42902#(< ~counter~0 37)} #82#return; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L272 TraceCheckUtils]: 18: Hoare triple {42902#(< ~counter~0 37)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41601#true} {42902#(< ~counter~0 37)} #80#return; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,904 INFO L272 TraceCheckUtils]: 13: Hoare triple {42902#(< ~counter~0 37)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,905 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {41601#true} {42902#(< ~counter~0 37)} #78#return; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {41601#true} assume true; {41601#true} is VALID [2022-04-27 14:00:48,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {41601#true} assume !(0 == ~cond); {41601#true} is VALID [2022-04-27 14:00:48,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {41601#true} ~cond := #in~cond; {41601#true} is VALID [2022-04-27 14:00:48,905 INFO L272 TraceCheckUtils]: 8: Hoare triple {42902#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {41601#true} is VALID [2022-04-27 14:00:48,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {42902#(< ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {42957#(< ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42902#(< ~counter~0 37)} is VALID [2022-04-27 14:00:48,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {42957#(< ~counter~0 36)} 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; {42957#(< ~counter~0 36)} is VALID [2022-04-27 14:00:48,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {42957#(< ~counter~0 36)} call #t~ret7 := main(); {42957#(< ~counter~0 36)} is VALID [2022-04-27 14:00:48,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42957#(< ~counter~0 36)} {41601#true} #92#return; {42957#(< ~counter~0 36)} is VALID [2022-04-27 14:00:48,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {42957#(< ~counter~0 36)} assume true; {42957#(< ~counter~0 36)} is VALID [2022-04-27 14:00:48,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {41601#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; {42957#(< ~counter~0 36)} is VALID [2022-04-27 14:00:48,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {41601#true} call ULTIMATE.init(); {41601#true} is VALID [2022-04-27 14:00:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 64 proven. 326 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2022-04-27 14:00:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:00:48,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156145775] [2022-04-27 14:00:48,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:00:48,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50431078] [2022-04-27 14:00:48,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50431078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:00:48,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:00:48,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-27 14:00:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557598221] [2022-04-27 14:00:48,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:00:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) Word has length 224 [2022-04-27 14:00:48,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:00:48,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) [2022-04-27 14:00:49,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:00:49,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 14:00:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:00:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 14:00:49,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 14:00:49,155 INFO L87 Difference]: Start difference. First operand 539 states and 604 transitions. Second operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) [2022-04-27 14:00:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:54,127 INFO L93 Difference]: Finished difference Result 1289 states and 1514 transitions. [2022-04-27 14:00:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-27 14:00:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) Word has length 224 [2022-04-27 14:00:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:00:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) [2022-04-27 14:00:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 680 transitions. [2022-04-27 14:00:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) [2022-04-27 14:00:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 680 transitions. [2022-04-27 14:00:54,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 680 transitions. [2022-04-27 14:00:54,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 680 edges. 680 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:00:54,782 INFO L225 Difference]: With dead ends: 1289 [2022-04-27 14:00:54,782 INFO L226 Difference]: Without dead ends: 1276 [2022-04-27 14:00:54,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1212, Invalid=2210, Unknown=0, NotChecked=0, Total=3422 [2022-04-27 14:00:54,785 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 853 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:00:54,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 865 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 14:00:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2022-04-27 14:00:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1275. [2022-04-27 14:00:55,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:00:55,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1276 states. Second operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) [2022-04-27 14:00:55,813 INFO L74 IsIncluded]: Start isIncluded. First operand 1276 states. Second operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) [2022-04-27 14:00:55,814 INFO L87 Difference]: Start difference. First operand 1276 states. Second operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) [2022-04-27 14:00:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:55,881 INFO L93 Difference]: Finished difference Result 1276 states and 1453 transitions. [2022-04-27 14:00:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1453 transitions. [2022-04-27 14:00:55,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:55,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:55,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) Second operand 1276 states. [2022-04-27 14:00:55,886 INFO L87 Difference]: Start difference. First operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) Second operand 1276 states. [2022-04-27 14:00:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:00:55,957 INFO L93 Difference]: Finished difference Result 1276 states and 1453 transitions. [2022-04-27 14:00:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1453 transitions. [2022-04-27 14:00:55,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:00:55,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:00:55,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:00:55,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:00:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 858 states have (on average 1.118881118881119) internal successors, (960), 885 states have internal predecessors, (960), 247 states have call successors, (247), 170 states have call predecessors, (247), 169 states have return successors, (245), 219 states have call predecessors, (245), 245 states have call successors, (245) [2022-04-27 14:00:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1452 transitions. [2022-04-27 14:00:56,051 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1452 transitions. Word has length 224 [2022-04-27 14:00:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:00:56,051 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1452 transitions. [2022-04-27 14:00:56,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.764705882352941) internal successors, (162), 34 states have internal predecessors, (162), 32 states have call successors, (68), 18 states have call predecessors, (68), 17 states have return successors, (66), 30 states have call predecessors, (66), 29 states have call successors, (66) [2022-04-27 14:00:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1452 transitions. [2022-04-27 14:00:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2022-04-27 14:00:56,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:00:56,060 INFO L195 NwaCegarLoop]: trace histogram [65, 64, 64, 27, 26, 26, 26, 26, 26, 26, 26, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:00:56,082 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-27 14:00:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:56,283 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:00:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:00:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1239263796, now seen corresponding path program 3 times [2022-04-27 14:00:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:00:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460084499] [2022-04-27 14:00:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:00:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:00:56,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:00:56,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154987714] [2022-04-27 14:00:56,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:00:56,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:00:56,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:00:56,328 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-27 14:00:56,351 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-27 14:00:59,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2022-04-27 14:00:59,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:00:59,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-27 14:00:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:00:59,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:01:01,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {49044#true} call ULTIMATE.init(); {49044#true} is VALID [2022-04-27 14:01:01,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {49044#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; {49052#(<= ~counter~0 0)} is VALID [2022-04-27 14:01:01,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {49052#(<= ~counter~0 0)} assume true; {49052#(<= ~counter~0 0)} is VALID [2022-04-27 14:01:01,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49052#(<= ~counter~0 0)} {49044#true} #92#return; {49052#(<= ~counter~0 0)} is VALID [2022-04-27 14:01:01,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {49052#(<= ~counter~0 0)} call #t~ret7 := main(); {49052#(<= ~counter~0 0)} is VALID [2022-04-27 14:01:01,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {49052#(<= ~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; {49052#(<= ~counter~0 0)} is VALID [2022-04-27 14:01:01,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {49052#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {49068#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {49068#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {49068#(<= ~counter~0 1)} ~cond := #in~cond; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {49068#(<= ~counter~0 1)} assume !(0 == ~cond); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {49068#(<= ~counter~0 1)} assume true; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,469 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {49068#(<= ~counter~0 1)} {49068#(<= ~counter~0 1)} #78#return; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,470 INFO L272 TraceCheckUtils]: 13: Hoare triple {49068#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {49068#(<= ~counter~0 1)} ~cond := #in~cond; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {49068#(<= ~counter~0 1)} assume !(0 == ~cond); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {49068#(<= ~counter~0 1)} assume true; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,471 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {49068#(<= ~counter~0 1)} {49068#(<= ~counter~0 1)} #80#return; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,471 INFO L272 TraceCheckUtils]: 18: Hoare triple {49068#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {49068#(<= ~counter~0 1)} ~cond := #in~cond; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {49068#(<= ~counter~0 1)} assume !(0 == ~cond); {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {49068#(<= ~counter~0 1)} assume true; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,473 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49068#(<= ~counter~0 1)} {49068#(<= ~counter~0 1)} #82#return; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {49068#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {49068#(<= ~counter~0 1)} is VALID [2022-04-27 14:01:01,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {49068#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {49123#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,474 INFO L272 TraceCheckUtils]: 26: Hoare triple {49123#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {49123#(<= ~counter~0 2)} ~cond := #in~cond; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {49123#(<= ~counter~0 2)} assume !(0 == ~cond); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {49123#(<= ~counter~0 2)} assume true; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,475 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {49123#(<= ~counter~0 2)} {49123#(<= ~counter~0 2)} #78#return; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,475 INFO L272 TraceCheckUtils]: 31: Hoare triple {49123#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {49123#(<= ~counter~0 2)} ~cond := #in~cond; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {49123#(<= ~counter~0 2)} assume !(0 == ~cond); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {49123#(<= ~counter~0 2)} assume true; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,476 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {49123#(<= ~counter~0 2)} {49123#(<= ~counter~0 2)} #80#return; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,477 INFO L272 TraceCheckUtils]: 36: Hoare triple {49123#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {49123#(<= ~counter~0 2)} ~cond := #in~cond; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {49123#(<= ~counter~0 2)} assume !(0 == ~cond); {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {49123#(<= ~counter~0 2)} assume true; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,478 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {49123#(<= ~counter~0 2)} {49123#(<= ~counter~0 2)} #82#return; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {49123#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {49123#(<= ~counter~0 2)} is VALID [2022-04-27 14:01:01,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {49123#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,479 INFO L290 TraceCheckUtils]: 43: Hoare triple {49178#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,480 INFO L272 TraceCheckUtils]: 44: Hoare triple {49178#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {49178#(<= ~counter~0 3)} ~cond := #in~cond; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {49178#(<= ~counter~0 3)} assume !(0 == ~cond); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {49178#(<= ~counter~0 3)} assume true; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,481 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {49178#(<= ~counter~0 3)} {49178#(<= ~counter~0 3)} #78#return; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,481 INFO L272 TraceCheckUtils]: 49: Hoare triple {49178#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {49178#(<= ~counter~0 3)} ~cond := #in~cond; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {49178#(<= ~counter~0 3)} assume !(0 == ~cond); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {49178#(<= ~counter~0 3)} assume true; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,482 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {49178#(<= ~counter~0 3)} {49178#(<= ~counter~0 3)} #80#return; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,483 INFO L272 TraceCheckUtils]: 54: Hoare triple {49178#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {49178#(<= ~counter~0 3)} ~cond := #in~cond; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {49178#(<= ~counter~0 3)} assume !(0 == ~cond); {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {49178#(<= ~counter~0 3)} assume true; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,484 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {49178#(<= ~counter~0 3)} {49178#(<= ~counter~0 3)} #82#return; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {49178#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {49178#(<= ~counter~0 3)} is VALID [2022-04-27 14:01:01,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {49178#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {49233#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,485 INFO L272 TraceCheckUtils]: 62: Hoare triple {49233#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {49233#(<= ~counter~0 4)} ~cond := #in~cond; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {49233#(<= ~counter~0 4)} assume !(0 == ~cond); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {49233#(<= ~counter~0 4)} assume true; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,486 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {49233#(<= ~counter~0 4)} {49233#(<= ~counter~0 4)} #78#return; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,487 INFO L272 TraceCheckUtils]: 67: Hoare triple {49233#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {49233#(<= ~counter~0 4)} ~cond := #in~cond; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {49233#(<= ~counter~0 4)} assume !(0 == ~cond); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,488 INFO L290 TraceCheckUtils]: 70: Hoare triple {49233#(<= ~counter~0 4)} assume true; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,488 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {49233#(<= ~counter~0 4)} {49233#(<= ~counter~0 4)} #80#return; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,488 INFO L272 TraceCheckUtils]: 72: Hoare triple {49233#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,489 INFO L290 TraceCheckUtils]: 73: Hoare triple {49233#(<= ~counter~0 4)} ~cond := #in~cond; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {49233#(<= ~counter~0 4)} assume !(0 == ~cond); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {49233#(<= ~counter~0 4)} assume true; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,489 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {49233#(<= ~counter~0 4)} {49233#(<= ~counter~0 4)} #82#return; {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,490 INFO L290 TraceCheckUtils]: 77: Hoare triple {49233#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {49233#(<= ~counter~0 4)} is VALID [2022-04-27 14:01:01,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {49233#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {49288#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,491 INFO L272 TraceCheckUtils]: 80: Hoare triple {49288#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {49288#(<= ~counter~0 5)} ~cond := #in~cond; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {49288#(<= ~counter~0 5)} assume !(0 == ~cond); {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {49288#(<= ~counter~0 5)} assume true; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,492 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {49288#(<= ~counter~0 5)} {49288#(<= ~counter~0 5)} #84#return; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,493 INFO L272 TraceCheckUtils]: 85: Hoare triple {49288#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,493 INFO L290 TraceCheckUtils]: 86: Hoare triple {49288#(<= ~counter~0 5)} ~cond := #in~cond; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,493 INFO L290 TraceCheckUtils]: 87: Hoare triple {49288#(<= ~counter~0 5)} assume !(0 == ~cond); {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,493 INFO L290 TraceCheckUtils]: 88: Hoare triple {49288#(<= ~counter~0 5)} assume true; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,494 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {49288#(<= ~counter~0 5)} {49288#(<= ~counter~0 5)} #86#return; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,494 INFO L290 TraceCheckUtils]: 90: Hoare triple {49288#(<= ~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); {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,494 INFO L290 TraceCheckUtils]: 91: Hoare triple {49288#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49288#(<= ~counter~0 5)} is VALID [2022-04-27 14:01:01,495 INFO L290 TraceCheckUtils]: 92: Hoare triple {49288#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,495 INFO L290 TraceCheckUtils]: 93: Hoare triple {49331#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,496 INFO L272 TraceCheckUtils]: 94: Hoare triple {49331#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,496 INFO L290 TraceCheckUtils]: 95: Hoare triple {49331#(<= ~counter~0 6)} ~cond := #in~cond; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,496 INFO L290 TraceCheckUtils]: 96: Hoare triple {49331#(<= ~counter~0 6)} assume !(0 == ~cond); {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,496 INFO L290 TraceCheckUtils]: 97: Hoare triple {49331#(<= ~counter~0 6)} assume true; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,497 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {49331#(<= ~counter~0 6)} {49331#(<= ~counter~0 6)} #84#return; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,497 INFO L272 TraceCheckUtils]: 99: Hoare triple {49331#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {49331#(<= ~counter~0 6)} ~cond := #in~cond; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,498 INFO L290 TraceCheckUtils]: 101: Hoare triple {49331#(<= ~counter~0 6)} assume !(0 == ~cond); {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {49331#(<= ~counter~0 6)} assume true; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,498 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {49331#(<= ~counter~0 6)} {49331#(<= ~counter~0 6)} #86#return; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,499 INFO L290 TraceCheckUtils]: 104: Hoare triple {49331#(<= ~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); {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {49331#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49331#(<= ~counter~0 6)} is VALID [2022-04-27 14:01:01,499 INFO L290 TraceCheckUtils]: 106: Hoare triple {49331#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,500 INFO L290 TraceCheckUtils]: 107: Hoare triple {49374#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,500 INFO L272 TraceCheckUtils]: 108: Hoare triple {49374#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,500 INFO L290 TraceCheckUtils]: 109: Hoare triple {49374#(<= ~counter~0 7)} ~cond := #in~cond; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,501 INFO L290 TraceCheckUtils]: 110: Hoare triple {49374#(<= ~counter~0 7)} assume !(0 == ~cond); {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,501 INFO L290 TraceCheckUtils]: 111: Hoare triple {49374#(<= ~counter~0 7)} assume true; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,501 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {49374#(<= ~counter~0 7)} {49374#(<= ~counter~0 7)} #84#return; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,507 INFO L272 TraceCheckUtils]: 113: Hoare triple {49374#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,508 INFO L290 TraceCheckUtils]: 114: Hoare triple {49374#(<= ~counter~0 7)} ~cond := #in~cond; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,508 INFO L290 TraceCheckUtils]: 115: Hoare triple {49374#(<= ~counter~0 7)} assume !(0 == ~cond); {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,509 INFO L290 TraceCheckUtils]: 116: Hoare triple {49374#(<= ~counter~0 7)} assume true; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,509 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {49374#(<= ~counter~0 7)} {49374#(<= ~counter~0 7)} #86#return; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,510 INFO L290 TraceCheckUtils]: 118: Hoare triple {49374#(<= ~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); {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,510 INFO L290 TraceCheckUtils]: 119: Hoare triple {49374#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49374#(<= ~counter~0 7)} is VALID [2022-04-27 14:01:01,511 INFO L290 TraceCheckUtils]: 120: Hoare triple {49374#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,511 INFO L290 TraceCheckUtils]: 121: Hoare triple {49417#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,512 INFO L272 TraceCheckUtils]: 122: Hoare triple {49417#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,512 INFO L290 TraceCheckUtils]: 123: Hoare triple {49417#(<= ~counter~0 8)} ~cond := #in~cond; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {49417#(<= ~counter~0 8)} assume !(0 == ~cond); {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,513 INFO L290 TraceCheckUtils]: 125: Hoare triple {49417#(<= ~counter~0 8)} assume true; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,513 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {49417#(<= ~counter~0 8)} {49417#(<= ~counter~0 8)} #84#return; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,514 INFO L272 TraceCheckUtils]: 127: Hoare triple {49417#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,514 INFO L290 TraceCheckUtils]: 128: Hoare triple {49417#(<= ~counter~0 8)} ~cond := #in~cond; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,515 INFO L290 TraceCheckUtils]: 129: Hoare triple {49417#(<= ~counter~0 8)} assume !(0 == ~cond); {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,515 INFO L290 TraceCheckUtils]: 130: Hoare triple {49417#(<= ~counter~0 8)} assume true; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,515 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {49417#(<= ~counter~0 8)} {49417#(<= ~counter~0 8)} #86#return; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,516 INFO L290 TraceCheckUtils]: 132: Hoare triple {49417#(<= ~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); {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,516 INFO L290 TraceCheckUtils]: 133: Hoare triple {49417#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49417#(<= ~counter~0 8)} is VALID [2022-04-27 14:01:01,517 INFO L290 TraceCheckUtils]: 134: Hoare triple {49417#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,517 INFO L290 TraceCheckUtils]: 135: Hoare triple {49460#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,518 INFO L272 TraceCheckUtils]: 136: Hoare triple {49460#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,518 INFO L290 TraceCheckUtils]: 137: Hoare triple {49460#(<= ~counter~0 9)} ~cond := #in~cond; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,519 INFO L290 TraceCheckUtils]: 138: Hoare triple {49460#(<= ~counter~0 9)} assume !(0 == ~cond); {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,519 INFO L290 TraceCheckUtils]: 139: Hoare triple {49460#(<= ~counter~0 9)} assume true; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,519 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {49460#(<= ~counter~0 9)} {49460#(<= ~counter~0 9)} #84#return; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,520 INFO L272 TraceCheckUtils]: 141: Hoare triple {49460#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,520 INFO L290 TraceCheckUtils]: 142: Hoare triple {49460#(<= ~counter~0 9)} ~cond := #in~cond; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,521 INFO L290 TraceCheckUtils]: 143: Hoare triple {49460#(<= ~counter~0 9)} assume !(0 == ~cond); {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,521 INFO L290 TraceCheckUtils]: 144: Hoare triple {49460#(<= ~counter~0 9)} assume true; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,522 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {49460#(<= ~counter~0 9)} {49460#(<= ~counter~0 9)} #86#return; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,522 INFO L290 TraceCheckUtils]: 146: Hoare triple {49460#(<= ~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); {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,522 INFO L290 TraceCheckUtils]: 147: Hoare triple {49460#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49460#(<= ~counter~0 9)} is VALID [2022-04-27 14:01:01,523 INFO L290 TraceCheckUtils]: 148: Hoare triple {49460#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,524 INFO L290 TraceCheckUtils]: 149: Hoare triple {49503#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,524 INFO L272 TraceCheckUtils]: 150: Hoare triple {49503#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,525 INFO L290 TraceCheckUtils]: 151: Hoare triple {49503#(<= ~counter~0 10)} ~cond := #in~cond; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,525 INFO L290 TraceCheckUtils]: 152: Hoare triple {49503#(<= ~counter~0 10)} assume !(0 == ~cond); {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,525 INFO L290 TraceCheckUtils]: 153: Hoare triple {49503#(<= ~counter~0 10)} assume true; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,526 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {49503#(<= ~counter~0 10)} {49503#(<= ~counter~0 10)} #84#return; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,526 INFO L272 TraceCheckUtils]: 155: Hoare triple {49503#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,527 INFO L290 TraceCheckUtils]: 156: Hoare triple {49503#(<= ~counter~0 10)} ~cond := #in~cond; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,527 INFO L290 TraceCheckUtils]: 157: Hoare triple {49503#(<= ~counter~0 10)} assume !(0 == ~cond); {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,527 INFO L290 TraceCheckUtils]: 158: Hoare triple {49503#(<= ~counter~0 10)} assume true; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,528 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {49503#(<= ~counter~0 10)} {49503#(<= ~counter~0 10)} #86#return; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,528 INFO L290 TraceCheckUtils]: 160: Hoare triple {49503#(<= ~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); {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,528 INFO L290 TraceCheckUtils]: 161: Hoare triple {49503#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49503#(<= ~counter~0 10)} is VALID [2022-04-27 14:01:01,529 INFO L290 TraceCheckUtils]: 162: Hoare triple {49503#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,530 INFO L290 TraceCheckUtils]: 163: Hoare triple {49546#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,530 INFO L272 TraceCheckUtils]: 164: Hoare triple {49546#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,531 INFO L290 TraceCheckUtils]: 165: Hoare triple {49546#(<= ~counter~0 11)} ~cond := #in~cond; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,531 INFO L290 TraceCheckUtils]: 166: Hoare triple {49546#(<= ~counter~0 11)} assume !(0 == ~cond); {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,531 INFO L290 TraceCheckUtils]: 167: Hoare triple {49546#(<= ~counter~0 11)} assume true; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,532 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {49546#(<= ~counter~0 11)} {49546#(<= ~counter~0 11)} #84#return; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,533 INFO L272 TraceCheckUtils]: 169: Hoare triple {49546#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,533 INFO L290 TraceCheckUtils]: 170: Hoare triple {49546#(<= ~counter~0 11)} ~cond := #in~cond; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,533 INFO L290 TraceCheckUtils]: 171: Hoare triple {49546#(<= ~counter~0 11)} assume !(0 == ~cond); {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,533 INFO L290 TraceCheckUtils]: 172: Hoare triple {49546#(<= ~counter~0 11)} assume true; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,534 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {49546#(<= ~counter~0 11)} {49546#(<= ~counter~0 11)} #86#return; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,534 INFO L290 TraceCheckUtils]: 174: Hoare triple {49546#(<= ~counter~0 11)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,535 INFO L290 TraceCheckUtils]: 175: Hoare triple {49546#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49546#(<= ~counter~0 11)} is VALID [2022-04-27 14:01:01,536 INFO L290 TraceCheckUtils]: 176: Hoare triple {49546#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,536 INFO L290 TraceCheckUtils]: 177: Hoare triple {49589#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,537 INFO L272 TraceCheckUtils]: 178: Hoare triple {49589#(<= ~counter~0 12)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,537 INFO L290 TraceCheckUtils]: 179: Hoare triple {49589#(<= ~counter~0 12)} ~cond := #in~cond; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,537 INFO L290 TraceCheckUtils]: 180: Hoare triple {49589#(<= ~counter~0 12)} assume !(0 == ~cond); {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,538 INFO L290 TraceCheckUtils]: 181: Hoare triple {49589#(<= ~counter~0 12)} assume true; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,538 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {49589#(<= ~counter~0 12)} {49589#(<= ~counter~0 12)} #84#return; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,539 INFO L272 TraceCheckUtils]: 183: Hoare triple {49589#(<= ~counter~0 12)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,539 INFO L290 TraceCheckUtils]: 184: Hoare triple {49589#(<= ~counter~0 12)} ~cond := #in~cond; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,539 INFO L290 TraceCheckUtils]: 185: Hoare triple {49589#(<= ~counter~0 12)} assume !(0 == ~cond); {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,540 INFO L290 TraceCheckUtils]: 186: Hoare triple {49589#(<= ~counter~0 12)} assume true; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,540 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {49589#(<= ~counter~0 12)} {49589#(<= ~counter~0 12)} #86#return; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,541 INFO L290 TraceCheckUtils]: 188: Hoare triple {49589#(<= ~counter~0 12)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,541 INFO L290 TraceCheckUtils]: 189: Hoare triple {49589#(<= ~counter~0 12)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49589#(<= ~counter~0 12)} is VALID [2022-04-27 14:01:01,542 INFO L290 TraceCheckUtils]: 190: Hoare triple {49589#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,542 INFO L290 TraceCheckUtils]: 191: Hoare triple {49632#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,543 INFO L272 TraceCheckUtils]: 192: Hoare triple {49632#(<= ~counter~0 13)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,543 INFO L290 TraceCheckUtils]: 193: Hoare triple {49632#(<= ~counter~0 13)} ~cond := #in~cond; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,543 INFO L290 TraceCheckUtils]: 194: Hoare triple {49632#(<= ~counter~0 13)} assume !(0 == ~cond); {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,544 INFO L290 TraceCheckUtils]: 195: Hoare triple {49632#(<= ~counter~0 13)} assume true; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,544 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {49632#(<= ~counter~0 13)} {49632#(<= ~counter~0 13)} #84#return; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,545 INFO L272 TraceCheckUtils]: 197: Hoare triple {49632#(<= ~counter~0 13)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,545 INFO L290 TraceCheckUtils]: 198: Hoare triple {49632#(<= ~counter~0 13)} ~cond := #in~cond; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,546 INFO L290 TraceCheckUtils]: 199: Hoare triple {49632#(<= ~counter~0 13)} assume !(0 == ~cond); {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,546 INFO L290 TraceCheckUtils]: 200: Hoare triple {49632#(<= ~counter~0 13)} assume true; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,546 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {49632#(<= ~counter~0 13)} {49632#(<= ~counter~0 13)} #86#return; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,547 INFO L290 TraceCheckUtils]: 202: Hoare triple {49632#(<= ~counter~0 13)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,547 INFO L290 TraceCheckUtils]: 203: Hoare triple {49632#(<= ~counter~0 13)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49632#(<= ~counter~0 13)} is VALID [2022-04-27 14:01:01,548 INFO L290 TraceCheckUtils]: 204: Hoare triple {49632#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,548 INFO L290 TraceCheckUtils]: 205: Hoare triple {49675#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,549 INFO L272 TraceCheckUtils]: 206: Hoare triple {49675#(<= ~counter~0 14)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,549 INFO L290 TraceCheckUtils]: 207: Hoare triple {49675#(<= ~counter~0 14)} ~cond := #in~cond; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,549 INFO L290 TraceCheckUtils]: 208: Hoare triple {49675#(<= ~counter~0 14)} assume !(0 == ~cond); {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,550 INFO L290 TraceCheckUtils]: 209: Hoare triple {49675#(<= ~counter~0 14)} assume true; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,550 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {49675#(<= ~counter~0 14)} {49675#(<= ~counter~0 14)} #84#return; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,551 INFO L272 TraceCheckUtils]: 211: Hoare triple {49675#(<= ~counter~0 14)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,551 INFO L290 TraceCheckUtils]: 212: Hoare triple {49675#(<= ~counter~0 14)} ~cond := #in~cond; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,551 INFO L290 TraceCheckUtils]: 213: Hoare triple {49675#(<= ~counter~0 14)} assume !(0 == ~cond); {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,552 INFO L290 TraceCheckUtils]: 214: Hoare triple {49675#(<= ~counter~0 14)} assume true; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,552 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {49675#(<= ~counter~0 14)} {49675#(<= ~counter~0 14)} #86#return; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,553 INFO L290 TraceCheckUtils]: 216: Hoare triple {49675#(<= ~counter~0 14)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,553 INFO L290 TraceCheckUtils]: 217: Hoare triple {49675#(<= ~counter~0 14)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49675#(<= ~counter~0 14)} is VALID [2022-04-27 14:01:01,554 INFO L290 TraceCheckUtils]: 218: Hoare triple {49675#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,554 INFO L290 TraceCheckUtils]: 219: Hoare triple {49718#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,555 INFO L272 TraceCheckUtils]: 220: Hoare triple {49718#(<= ~counter~0 15)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,555 INFO L290 TraceCheckUtils]: 221: Hoare triple {49718#(<= ~counter~0 15)} ~cond := #in~cond; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,556 INFO L290 TraceCheckUtils]: 222: Hoare triple {49718#(<= ~counter~0 15)} assume !(0 == ~cond); {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,556 INFO L290 TraceCheckUtils]: 223: Hoare triple {49718#(<= ~counter~0 15)} assume true; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,557 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {49718#(<= ~counter~0 15)} {49718#(<= ~counter~0 15)} #84#return; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,557 INFO L272 TraceCheckUtils]: 225: Hoare triple {49718#(<= ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,558 INFO L290 TraceCheckUtils]: 226: Hoare triple {49718#(<= ~counter~0 15)} ~cond := #in~cond; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,558 INFO L290 TraceCheckUtils]: 227: Hoare triple {49718#(<= ~counter~0 15)} assume !(0 == ~cond); {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,558 INFO L290 TraceCheckUtils]: 228: Hoare triple {49718#(<= ~counter~0 15)} assume true; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,559 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {49718#(<= ~counter~0 15)} {49718#(<= ~counter~0 15)} #86#return; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,559 INFO L290 TraceCheckUtils]: 230: Hoare triple {49718#(<= ~counter~0 15)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,559 INFO L290 TraceCheckUtils]: 231: Hoare triple {49718#(<= ~counter~0 15)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49718#(<= ~counter~0 15)} is VALID [2022-04-27 14:01:01,560 INFO L290 TraceCheckUtils]: 232: Hoare triple {49718#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,561 INFO L290 TraceCheckUtils]: 233: Hoare triple {49761#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,561 INFO L272 TraceCheckUtils]: 234: Hoare triple {49761#(<= ~counter~0 16)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,561 INFO L290 TraceCheckUtils]: 235: Hoare triple {49761#(<= ~counter~0 16)} ~cond := #in~cond; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,562 INFO L290 TraceCheckUtils]: 236: Hoare triple {49761#(<= ~counter~0 16)} assume !(0 == ~cond); {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,562 INFO L290 TraceCheckUtils]: 237: Hoare triple {49761#(<= ~counter~0 16)} assume true; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,562 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {49761#(<= ~counter~0 16)} {49761#(<= ~counter~0 16)} #84#return; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,563 INFO L272 TraceCheckUtils]: 239: Hoare triple {49761#(<= ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,563 INFO L290 TraceCheckUtils]: 240: Hoare triple {49761#(<= ~counter~0 16)} ~cond := #in~cond; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,563 INFO L290 TraceCheckUtils]: 241: Hoare triple {49761#(<= ~counter~0 16)} assume !(0 == ~cond); {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,563 INFO L290 TraceCheckUtils]: 242: Hoare triple {49761#(<= ~counter~0 16)} assume true; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,564 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {49761#(<= ~counter~0 16)} {49761#(<= ~counter~0 16)} #86#return; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,564 INFO L290 TraceCheckUtils]: 244: Hoare triple {49761#(<= ~counter~0 16)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,564 INFO L290 TraceCheckUtils]: 245: Hoare triple {49761#(<= ~counter~0 16)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49761#(<= ~counter~0 16)} is VALID [2022-04-27 14:01:01,565 INFO L290 TraceCheckUtils]: 246: Hoare triple {49761#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,565 INFO L290 TraceCheckUtils]: 247: Hoare triple {49804#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,566 INFO L272 TraceCheckUtils]: 248: Hoare triple {49804#(<= ~counter~0 17)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,566 INFO L290 TraceCheckUtils]: 249: Hoare triple {49804#(<= ~counter~0 17)} ~cond := #in~cond; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,566 INFO L290 TraceCheckUtils]: 250: Hoare triple {49804#(<= ~counter~0 17)} assume !(0 == ~cond); {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,566 INFO L290 TraceCheckUtils]: 251: Hoare triple {49804#(<= ~counter~0 17)} assume true; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,567 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {49804#(<= ~counter~0 17)} {49804#(<= ~counter~0 17)} #84#return; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,567 INFO L272 TraceCheckUtils]: 253: Hoare triple {49804#(<= ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,567 INFO L290 TraceCheckUtils]: 254: Hoare triple {49804#(<= ~counter~0 17)} ~cond := #in~cond; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,568 INFO L290 TraceCheckUtils]: 255: Hoare triple {49804#(<= ~counter~0 17)} assume !(0 == ~cond); {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,568 INFO L290 TraceCheckUtils]: 256: Hoare triple {49804#(<= ~counter~0 17)} assume true; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,568 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {49804#(<= ~counter~0 17)} {49804#(<= ~counter~0 17)} #86#return; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,569 INFO L290 TraceCheckUtils]: 258: Hoare triple {49804#(<= ~counter~0 17)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,569 INFO L290 TraceCheckUtils]: 259: Hoare triple {49804#(<= ~counter~0 17)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49804#(<= ~counter~0 17)} is VALID [2022-04-27 14:01:01,569 INFO L290 TraceCheckUtils]: 260: Hoare triple {49804#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,570 INFO L290 TraceCheckUtils]: 261: Hoare triple {49847#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,570 INFO L272 TraceCheckUtils]: 262: Hoare triple {49847#(<= ~counter~0 18)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,570 INFO L290 TraceCheckUtils]: 263: Hoare triple {49847#(<= ~counter~0 18)} ~cond := #in~cond; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,571 INFO L290 TraceCheckUtils]: 264: Hoare triple {49847#(<= ~counter~0 18)} assume !(0 == ~cond); {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,571 INFO L290 TraceCheckUtils]: 265: Hoare triple {49847#(<= ~counter~0 18)} assume true; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,571 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {49847#(<= ~counter~0 18)} {49847#(<= ~counter~0 18)} #84#return; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,572 INFO L272 TraceCheckUtils]: 267: Hoare triple {49847#(<= ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,572 INFO L290 TraceCheckUtils]: 268: Hoare triple {49847#(<= ~counter~0 18)} ~cond := #in~cond; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,572 INFO L290 TraceCheckUtils]: 269: Hoare triple {49847#(<= ~counter~0 18)} assume !(0 == ~cond); {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,572 INFO L290 TraceCheckUtils]: 270: Hoare triple {49847#(<= ~counter~0 18)} assume true; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,573 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {49847#(<= ~counter~0 18)} {49847#(<= ~counter~0 18)} #86#return; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,573 INFO L290 TraceCheckUtils]: 272: Hoare triple {49847#(<= ~counter~0 18)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,573 INFO L290 TraceCheckUtils]: 273: Hoare triple {49847#(<= ~counter~0 18)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49847#(<= ~counter~0 18)} is VALID [2022-04-27 14:01:01,574 INFO L290 TraceCheckUtils]: 274: Hoare triple {49847#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,574 INFO L290 TraceCheckUtils]: 275: Hoare triple {49890#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,575 INFO L272 TraceCheckUtils]: 276: Hoare triple {49890#(<= ~counter~0 19)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,575 INFO L290 TraceCheckUtils]: 277: Hoare triple {49890#(<= ~counter~0 19)} ~cond := #in~cond; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,575 INFO L290 TraceCheckUtils]: 278: Hoare triple {49890#(<= ~counter~0 19)} assume !(0 == ~cond); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,575 INFO L290 TraceCheckUtils]: 279: Hoare triple {49890#(<= ~counter~0 19)} assume true; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,576 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {49890#(<= ~counter~0 19)} {49890#(<= ~counter~0 19)} #84#return; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,576 INFO L272 TraceCheckUtils]: 281: Hoare triple {49890#(<= ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,577 INFO L290 TraceCheckUtils]: 282: Hoare triple {49890#(<= ~counter~0 19)} ~cond := #in~cond; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,577 INFO L290 TraceCheckUtils]: 283: Hoare triple {49890#(<= ~counter~0 19)} assume !(0 == ~cond); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,577 INFO L290 TraceCheckUtils]: 284: Hoare triple {49890#(<= ~counter~0 19)} assume true; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,577 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {49890#(<= ~counter~0 19)} {49890#(<= ~counter~0 19)} #86#return; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,578 INFO L290 TraceCheckUtils]: 286: Hoare triple {49890#(<= ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,578 INFO L290 TraceCheckUtils]: 287: Hoare triple {49890#(<= ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:01,578 INFO L290 TraceCheckUtils]: 288: Hoare triple {49890#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,579 INFO L290 TraceCheckUtils]: 289: Hoare triple {49933#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,579 INFO L272 TraceCheckUtils]: 290: Hoare triple {49933#(<= ~counter~0 20)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,579 INFO L290 TraceCheckUtils]: 291: Hoare triple {49933#(<= ~counter~0 20)} ~cond := #in~cond; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,580 INFO L290 TraceCheckUtils]: 292: Hoare triple {49933#(<= ~counter~0 20)} assume !(0 == ~cond); {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,580 INFO L290 TraceCheckUtils]: 293: Hoare triple {49933#(<= ~counter~0 20)} assume true; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,580 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {49933#(<= ~counter~0 20)} {49933#(<= ~counter~0 20)} #84#return; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,581 INFO L272 TraceCheckUtils]: 295: Hoare triple {49933#(<= ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,581 INFO L290 TraceCheckUtils]: 296: Hoare triple {49933#(<= ~counter~0 20)} ~cond := #in~cond; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,581 INFO L290 TraceCheckUtils]: 297: Hoare triple {49933#(<= ~counter~0 20)} assume !(0 == ~cond); {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,581 INFO L290 TraceCheckUtils]: 298: Hoare triple {49933#(<= ~counter~0 20)} assume true; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,582 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {49933#(<= ~counter~0 20)} {49933#(<= ~counter~0 20)} #86#return; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,582 INFO L290 TraceCheckUtils]: 300: Hoare triple {49933#(<= ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,582 INFO L290 TraceCheckUtils]: 301: Hoare triple {49933#(<= ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:01,583 INFO L290 TraceCheckUtils]: 302: Hoare triple {49933#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,583 INFO L290 TraceCheckUtils]: 303: Hoare triple {49976#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,584 INFO L272 TraceCheckUtils]: 304: Hoare triple {49976#(<= ~counter~0 21)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,584 INFO L290 TraceCheckUtils]: 305: Hoare triple {49976#(<= ~counter~0 21)} ~cond := #in~cond; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,584 INFO L290 TraceCheckUtils]: 306: Hoare triple {49976#(<= ~counter~0 21)} assume !(0 == ~cond); {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,584 INFO L290 TraceCheckUtils]: 307: Hoare triple {49976#(<= ~counter~0 21)} assume true; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,585 INFO L284 TraceCheckUtils]: 308: Hoare quadruple {49976#(<= ~counter~0 21)} {49976#(<= ~counter~0 21)} #84#return; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,585 INFO L272 TraceCheckUtils]: 309: Hoare triple {49976#(<= ~counter~0 21)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,586 INFO L290 TraceCheckUtils]: 310: Hoare triple {49976#(<= ~counter~0 21)} ~cond := #in~cond; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,586 INFO L290 TraceCheckUtils]: 311: Hoare triple {49976#(<= ~counter~0 21)} assume !(0 == ~cond); {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,586 INFO L290 TraceCheckUtils]: 312: Hoare triple {49976#(<= ~counter~0 21)} assume true; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,587 INFO L284 TraceCheckUtils]: 313: Hoare quadruple {49976#(<= ~counter~0 21)} {49976#(<= ~counter~0 21)} #86#return; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,587 INFO L290 TraceCheckUtils]: 314: Hoare triple {49976#(<= ~counter~0 21)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,587 INFO L290 TraceCheckUtils]: 315: Hoare triple {49976#(<= ~counter~0 21)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:01,588 INFO L290 TraceCheckUtils]: 316: Hoare triple {49976#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,588 INFO L290 TraceCheckUtils]: 317: Hoare triple {50019#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,588 INFO L272 TraceCheckUtils]: 318: Hoare triple {50019#(<= ~counter~0 22)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,589 INFO L290 TraceCheckUtils]: 319: Hoare triple {50019#(<= ~counter~0 22)} ~cond := #in~cond; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,589 INFO L290 TraceCheckUtils]: 320: Hoare triple {50019#(<= ~counter~0 22)} assume !(0 == ~cond); {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,589 INFO L290 TraceCheckUtils]: 321: Hoare triple {50019#(<= ~counter~0 22)} assume true; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,590 INFO L284 TraceCheckUtils]: 322: Hoare quadruple {50019#(<= ~counter~0 22)} {50019#(<= ~counter~0 22)} #84#return; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,590 INFO L272 TraceCheckUtils]: 323: Hoare triple {50019#(<= ~counter~0 22)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,590 INFO L290 TraceCheckUtils]: 324: Hoare triple {50019#(<= ~counter~0 22)} ~cond := #in~cond; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,590 INFO L290 TraceCheckUtils]: 325: Hoare triple {50019#(<= ~counter~0 22)} assume !(0 == ~cond); {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,591 INFO L290 TraceCheckUtils]: 326: Hoare triple {50019#(<= ~counter~0 22)} assume true; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,591 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {50019#(<= ~counter~0 22)} {50019#(<= ~counter~0 22)} #86#return; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,591 INFO L290 TraceCheckUtils]: 328: Hoare triple {50019#(<= ~counter~0 22)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,592 INFO L290 TraceCheckUtils]: 329: Hoare triple {50019#(<= ~counter~0 22)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:01,592 INFO L290 TraceCheckUtils]: 330: Hoare triple {50019#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,592 INFO L290 TraceCheckUtils]: 331: Hoare triple {50062#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,593 INFO L272 TraceCheckUtils]: 332: Hoare triple {50062#(<= ~counter~0 23)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,593 INFO L290 TraceCheckUtils]: 333: Hoare triple {50062#(<= ~counter~0 23)} ~cond := #in~cond; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,593 INFO L290 TraceCheckUtils]: 334: Hoare triple {50062#(<= ~counter~0 23)} assume !(0 == ~cond); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,594 INFO L290 TraceCheckUtils]: 335: Hoare triple {50062#(<= ~counter~0 23)} assume true; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,594 INFO L284 TraceCheckUtils]: 336: Hoare quadruple {50062#(<= ~counter~0 23)} {50062#(<= ~counter~0 23)} #84#return; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,595 INFO L272 TraceCheckUtils]: 337: Hoare triple {50062#(<= ~counter~0 23)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,595 INFO L290 TraceCheckUtils]: 338: Hoare triple {50062#(<= ~counter~0 23)} ~cond := #in~cond; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,595 INFO L290 TraceCheckUtils]: 339: Hoare triple {50062#(<= ~counter~0 23)} assume !(0 == ~cond); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,595 INFO L290 TraceCheckUtils]: 340: Hoare triple {50062#(<= ~counter~0 23)} assume true; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,596 INFO L284 TraceCheckUtils]: 341: Hoare quadruple {50062#(<= ~counter~0 23)} {50062#(<= ~counter~0 23)} #86#return; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,596 INFO L290 TraceCheckUtils]: 342: Hoare triple {50062#(<= ~counter~0 23)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,596 INFO L290 TraceCheckUtils]: 343: Hoare triple {50062#(<= ~counter~0 23)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:01,597 INFO L290 TraceCheckUtils]: 344: Hoare triple {50062#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,597 INFO L290 TraceCheckUtils]: 345: Hoare triple {50105#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,597 INFO L272 TraceCheckUtils]: 346: Hoare triple {50105#(<= ~counter~0 24)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,598 INFO L290 TraceCheckUtils]: 347: Hoare triple {50105#(<= ~counter~0 24)} ~cond := #in~cond; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,598 INFO L290 TraceCheckUtils]: 348: Hoare triple {50105#(<= ~counter~0 24)} assume !(0 == ~cond); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,598 INFO L290 TraceCheckUtils]: 349: Hoare triple {50105#(<= ~counter~0 24)} assume true; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,599 INFO L284 TraceCheckUtils]: 350: Hoare quadruple {50105#(<= ~counter~0 24)} {50105#(<= ~counter~0 24)} #84#return; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,599 INFO L272 TraceCheckUtils]: 351: Hoare triple {50105#(<= ~counter~0 24)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,599 INFO L290 TraceCheckUtils]: 352: Hoare triple {50105#(<= ~counter~0 24)} ~cond := #in~cond; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,600 INFO L290 TraceCheckUtils]: 353: Hoare triple {50105#(<= ~counter~0 24)} assume !(0 == ~cond); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,600 INFO L290 TraceCheckUtils]: 354: Hoare triple {50105#(<= ~counter~0 24)} assume true; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,600 INFO L284 TraceCheckUtils]: 355: Hoare quadruple {50105#(<= ~counter~0 24)} {50105#(<= ~counter~0 24)} #86#return; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,600 INFO L290 TraceCheckUtils]: 356: Hoare triple {50105#(<= ~counter~0 24)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,601 INFO L290 TraceCheckUtils]: 357: Hoare triple {50105#(<= ~counter~0 24)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:01,601 INFO L290 TraceCheckUtils]: 358: Hoare triple {50105#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,602 INFO L290 TraceCheckUtils]: 359: Hoare triple {50148#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,602 INFO L272 TraceCheckUtils]: 360: Hoare triple {50148#(<= ~counter~0 25)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,602 INFO L290 TraceCheckUtils]: 361: Hoare triple {50148#(<= ~counter~0 25)} ~cond := #in~cond; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,602 INFO L290 TraceCheckUtils]: 362: Hoare triple {50148#(<= ~counter~0 25)} assume !(0 == ~cond); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,603 INFO L290 TraceCheckUtils]: 363: Hoare triple {50148#(<= ~counter~0 25)} assume true; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,603 INFO L284 TraceCheckUtils]: 364: Hoare quadruple {50148#(<= ~counter~0 25)} {50148#(<= ~counter~0 25)} #84#return; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,604 INFO L272 TraceCheckUtils]: 365: Hoare triple {50148#(<= ~counter~0 25)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,604 INFO L290 TraceCheckUtils]: 366: Hoare triple {50148#(<= ~counter~0 25)} ~cond := #in~cond; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,604 INFO L290 TraceCheckUtils]: 367: Hoare triple {50148#(<= ~counter~0 25)} assume !(0 == ~cond); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,604 INFO L290 TraceCheckUtils]: 368: Hoare triple {50148#(<= ~counter~0 25)} assume true; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,605 INFO L284 TraceCheckUtils]: 369: Hoare quadruple {50148#(<= ~counter~0 25)} {50148#(<= ~counter~0 25)} #86#return; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,605 INFO L290 TraceCheckUtils]: 370: Hoare triple {50148#(<= ~counter~0 25)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,605 INFO L290 TraceCheckUtils]: 371: Hoare triple {50148#(<= ~counter~0 25)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:01,606 INFO L290 TraceCheckUtils]: 372: Hoare triple {50148#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,606 INFO L290 TraceCheckUtils]: 373: Hoare triple {50191#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,607 INFO L272 TraceCheckUtils]: 374: Hoare triple {50191#(<= ~counter~0 26)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,607 INFO L290 TraceCheckUtils]: 375: Hoare triple {50191#(<= ~counter~0 26)} ~cond := #in~cond; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,607 INFO L290 TraceCheckUtils]: 376: Hoare triple {50191#(<= ~counter~0 26)} assume !(0 == ~cond); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,607 INFO L290 TraceCheckUtils]: 377: Hoare triple {50191#(<= ~counter~0 26)} assume true; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,608 INFO L284 TraceCheckUtils]: 378: Hoare quadruple {50191#(<= ~counter~0 26)} {50191#(<= ~counter~0 26)} #84#return; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,608 INFO L272 TraceCheckUtils]: 379: Hoare triple {50191#(<= ~counter~0 26)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,608 INFO L290 TraceCheckUtils]: 380: Hoare triple {50191#(<= ~counter~0 26)} ~cond := #in~cond; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,609 INFO L290 TraceCheckUtils]: 381: Hoare triple {50191#(<= ~counter~0 26)} assume !(0 == ~cond); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,609 INFO L290 TraceCheckUtils]: 382: Hoare triple {50191#(<= ~counter~0 26)} assume true; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,609 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {50191#(<= ~counter~0 26)} {50191#(<= ~counter~0 26)} #86#return; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,610 INFO L290 TraceCheckUtils]: 384: Hoare triple {50191#(<= ~counter~0 26)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,610 INFO L290 TraceCheckUtils]: 385: Hoare triple {50191#(<= ~counter~0 26)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:01,610 INFO L290 TraceCheckUtils]: 386: Hoare triple {50191#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,611 INFO L290 TraceCheckUtils]: 387: Hoare triple {50234#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,611 INFO L272 TraceCheckUtils]: 388: Hoare triple {50234#(<= ~counter~0 27)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,611 INFO L290 TraceCheckUtils]: 389: Hoare triple {50234#(<= ~counter~0 27)} ~cond := #in~cond; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,612 INFO L290 TraceCheckUtils]: 390: Hoare triple {50234#(<= ~counter~0 27)} assume !(0 == ~cond); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,612 INFO L290 TraceCheckUtils]: 391: Hoare triple {50234#(<= ~counter~0 27)} assume true; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,612 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {50234#(<= ~counter~0 27)} {50234#(<= ~counter~0 27)} #84#return; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,613 INFO L272 TraceCheckUtils]: 393: Hoare triple {50234#(<= ~counter~0 27)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,613 INFO L290 TraceCheckUtils]: 394: Hoare triple {50234#(<= ~counter~0 27)} ~cond := #in~cond; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,613 INFO L290 TraceCheckUtils]: 395: Hoare triple {50234#(<= ~counter~0 27)} assume !(0 == ~cond); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,613 INFO L290 TraceCheckUtils]: 396: Hoare triple {50234#(<= ~counter~0 27)} assume true; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,614 INFO L284 TraceCheckUtils]: 397: Hoare quadruple {50234#(<= ~counter~0 27)} {50234#(<= ~counter~0 27)} #86#return; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,614 INFO L290 TraceCheckUtils]: 398: Hoare triple {50234#(<= ~counter~0 27)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,614 INFO L290 TraceCheckUtils]: 399: Hoare triple {50234#(<= ~counter~0 27)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:01,615 INFO L290 TraceCheckUtils]: 400: Hoare triple {50234#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,615 INFO L290 TraceCheckUtils]: 401: Hoare triple {50277#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,616 INFO L272 TraceCheckUtils]: 402: Hoare triple {50277#(<= ~counter~0 28)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,616 INFO L290 TraceCheckUtils]: 403: Hoare triple {50277#(<= ~counter~0 28)} ~cond := #in~cond; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,616 INFO L290 TraceCheckUtils]: 404: Hoare triple {50277#(<= ~counter~0 28)} assume !(0 == ~cond); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,616 INFO L290 TraceCheckUtils]: 405: Hoare triple {50277#(<= ~counter~0 28)} assume true; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,617 INFO L284 TraceCheckUtils]: 406: Hoare quadruple {50277#(<= ~counter~0 28)} {50277#(<= ~counter~0 28)} #84#return; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,617 INFO L272 TraceCheckUtils]: 407: Hoare triple {50277#(<= ~counter~0 28)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,618 INFO L290 TraceCheckUtils]: 408: Hoare triple {50277#(<= ~counter~0 28)} ~cond := #in~cond; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,618 INFO L290 TraceCheckUtils]: 409: Hoare triple {50277#(<= ~counter~0 28)} assume !(0 == ~cond); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,618 INFO L290 TraceCheckUtils]: 410: Hoare triple {50277#(<= ~counter~0 28)} assume true; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,618 INFO L284 TraceCheckUtils]: 411: Hoare quadruple {50277#(<= ~counter~0 28)} {50277#(<= ~counter~0 28)} #86#return; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,619 INFO L290 TraceCheckUtils]: 412: Hoare triple {50277#(<= ~counter~0 28)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,619 INFO L290 TraceCheckUtils]: 413: Hoare triple {50277#(<= ~counter~0 28)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:01,620 INFO L290 TraceCheckUtils]: 414: Hoare triple {50277#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,620 INFO L290 TraceCheckUtils]: 415: Hoare triple {50320#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,620 INFO L272 TraceCheckUtils]: 416: Hoare triple {50320#(<= ~counter~0 29)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,621 INFO L290 TraceCheckUtils]: 417: Hoare triple {50320#(<= ~counter~0 29)} ~cond := #in~cond; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,621 INFO L290 TraceCheckUtils]: 418: Hoare triple {50320#(<= ~counter~0 29)} assume !(0 == ~cond); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,621 INFO L290 TraceCheckUtils]: 419: Hoare triple {50320#(<= ~counter~0 29)} assume true; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,622 INFO L284 TraceCheckUtils]: 420: Hoare quadruple {50320#(<= ~counter~0 29)} {50320#(<= ~counter~0 29)} #84#return; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,622 INFO L272 TraceCheckUtils]: 421: Hoare triple {50320#(<= ~counter~0 29)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,622 INFO L290 TraceCheckUtils]: 422: Hoare triple {50320#(<= ~counter~0 29)} ~cond := #in~cond; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,622 INFO L290 TraceCheckUtils]: 423: Hoare triple {50320#(<= ~counter~0 29)} assume !(0 == ~cond); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,623 INFO L290 TraceCheckUtils]: 424: Hoare triple {50320#(<= ~counter~0 29)} assume true; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,623 INFO L284 TraceCheckUtils]: 425: Hoare quadruple {50320#(<= ~counter~0 29)} {50320#(<= ~counter~0 29)} #86#return; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,623 INFO L290 TraceCheckUtils]: 426: Hoare triple {50320#(<= ~counter~0 29)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,624 INFO L290 TraceCheckUtils]: 427: Hoare triple {50320#(<= ~counter~0 29)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:01,624 INFO L290 TraceCheckUtils]: 428: Hoare triple {50320#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,624 INFO L290 TraceCheckUtils]: 429: Hoare triple {50363#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,625 INFO L272 TraceCheckUtils]: 430: Hoare triple {50363#(<= ~counter~0 30)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,625 INFO L290 TraceCheckUtils]: 431: Hoare triple {50363#(<= ~counter~0 30)} ~cond := #in~cond; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,625 INFO L290 TraceCheckUtils]: 432: Hoare triple {50363#(<= ~counter~0 30)} assume !(0 == ~cond); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,626 INFO L290 TraceCheckUtils]: 433: Hoare triple {50363#(<= ~counter~0 30)} assume true; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,626 INFO L284 TraceCheckUtils]: 434: Hoare quadruple {50363#(<= ~counter~0 30)} {50363#(<= ~counter~0 30)} #84#return; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,627 INFO L272 TraceCheckUtils]: 435: Hoare triple {50363#(<= ~counter~0 30)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,627 INFO L290 TraceCheckUtils]: 436: Hoare triple {50363#(<= ~counter~0 30)} ~cond := #in~cond; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,627 INFO L290 TraceCheckUtils]: 437: Hoare triple {50363#(<= ~counter~0 30)} assume !(0 == ~cond); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,627 INFO L290 TraceCheckUtils]: 438: Hoare triple {50363#(<= ~counter~0 30)} assume true; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,628 INFO L284 TraceCheckUtils]: 439: Hoare quadruple {50363#(<= ~counter~0 30)} {50363#(<= ~counter~0 30)} #86#return; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,628 INFO L290 TraceCheckUtils]: 440: Hoare triple {50363#(<= ~counter~0 30)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,628 INFO L290 TraceCheckUtils]: 441: Hoare triple {50363#(<= ~counter~0 30)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:01,628 INFO L290 TraceCheckUtils]: 442: Hoare triple {50363#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50406#(<= |main_#t~post6| 30)} is VALID [2022-04-27 14:01:01,629 INFO L290 TraceCheckUtils]: 443: Hoare triple {50406#(<= |main_#t~post6| 30)} assume !(#t~post6 < 50);havoc #t~post6; {49045#false} is VALID [2022-04-27 14:01:01,629 INFO L272 TraceCheckUtils]: 444: Hoare triple {49045#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {49045#false} is VALID [2022-04-27 14:01:01,629 INFO L290 TraceCheckUtils]: 445: Hoare triple {49045#false} ~cond := #in~cond; {49045#false} is VALID [2022-04-27 14:01:01,629 INFO L290 TraceCheckUtils]: 446: Hoare triple {49045#false} assume 0 == ~cond; {49045#false} is VALID [2022-04-27 14:01:01,629 INFO L290 TraceCheckUtils]: 447: Hoare triple {49045#false} assume !false; {49045#false} is VALID [2022-04-27 14:01:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10230 backedges. 128 proven. 9950 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-04-27 14:01:01,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:01:03,788 INFO L290 TraceCheckUtils]: 447: Hoare triple {49045#false} assume !false; {49045#false} is VALID [2022-04-27 14:01:03,789 INFO L290 TraceCheckUtils]: 446: Hoare triple {49045#false} assume 0 == ~cond; {49045#false} is VALID [2022-04-27 14:01:03,789 INFO L290 TraceCheckUtils]: 445: Hoare triple {49045#false} ~cond := #in~cond; {49045#false} is VALID [2022-04-27 14:01:03,789 INFO L272 TraceCheckUtils]: 444: Hoare triple {49045#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {49045#false} is VALID [2022-04-27 14:01:03,789 INFO L290 TraceCheckUtils]: 443: Hoare triple {50434#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {49045#false} is VALID [2022-04-27 14:01:03,789 INFO L290 TraceCheckUtils]: 442: Hoare triple {50438#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50434#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:01:03,790 INFO L290 TraceCheckUtils]: 441: Hoare triple {50438#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,790 INFO L290 TraceCheckUtils]: 440: Hoare triple {50438#(< ~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); {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,790 INFO L284 TraceCheckUtils]: 439: Hoare quadruple {49044#true} {50438#(< ~counter~0 50)} #86#return; {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,790 INFO L290 TraceCheckUtils]: 438: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,790 INFO L290 TraceCheckUtils]: 437: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,790 INFO L290 TraceCheckUtils]: 436: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L272 TraceCheckUtils]: 435: Hoare triple {50438#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L284 TraceCheckUtils]: 434: Hoare quadruple {49044#true} {50438#(< ~counter~0 50)} #84#return; {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,791 INFO L290 TraceCheckUtils]: 433: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L290 TraceCheckUtils]: 432: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L290 TraceCheckUtils]: 431: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L272 TraceCheckUtils]: 430: Hoare triple {50438#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,791 INFO L290 TraceCheckUtils]: 429: Hoare triple {50438#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,792 INFO L290 TraceCheckUtils]: 428: Hoare triple {50481#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50438#(< ~counter~0 50)} is VALID [2022-04-27 14:01:03,792 INFO L290 TraceCheckUtils]: 427: Hoare triple {50481#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,793 INFO L290 TraceCheckUtils]: 426: Hoare triple {50481#(< ~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); {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,793 INFO L284 TraceCheckUtils]: 425: Hoare quadruple {49044#true} {50481#(< ~counter~0 49)} #86#return; {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,793 INFO L290 TraceCheckUtils]: 424: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,793 INFO L290 TraceCheckUtils]: 423: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,793 INFO L290 TraceCheckUtils]: 422: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,793 INFO L272 TraceCheckUtils]: 421: Hoare triple {50481#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,794 INFO L284 TraceCheckUtils]: 420: Hoare quadruple {49044#true} {50481#(< ~counter~0 49)} #84#return; {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,794 INFO L290 TraceCheckUtils]: 419: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,794 INFO L290 TraceCheckUtils]: 418: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,794 INFO L290 TraceCheckUtils]: 417: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,794 INFO L272 TraceCheckUtils]: 416: Hoare triple {50481#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,794 INFO L290 TraceCheckUtils]: 415: Hoare triple {50481#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,795 INFO L290 TraceCheckUtils]: 414: Hoare triple {50524#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50481#(< ~counter~0 49)} is VALID [2022-04-27 14:01:03,795 INFO L290 TraceCheckUtils]: 413: Hoare triple {50524#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,795 INFO L290 TraceCheckUtils]: 412: Hoare triple {50524#(< ~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); {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,796 INFO L284 TraceCheckUtils]: 411: Hoare quadruple {49044#true} {50524#(< ~counter~0 48)} #86#return; {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 410: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 409: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 408: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L272 TraceCheckUtils]: 407: Hoare triple {50524#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L284 TraceCheckUtils]: 406: Hoare quadruple {49044#true} {50524#(< ~counter~0 48)} #84#return; {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 405: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 404: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,796 INFO L290 TraceCheckUtils]: 403: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,797 INFO L272 TraceCheckUtils]: 402: Hoare triple {50524#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,797 INFO L290 TraceCheckUtils]: 401: Hoare triple {50524#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,797 INFO L290 TraceCheckUtils]: 400: Hoare triple {50567#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50524#(< ~counter~0 48)} is VALID [2022-04-27 14:01:03,798 INFO L290 TraceCheckUtils]: 399: Hoare triple {50567#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,798 INFO L290 TraceCheckUtils]: 398: Hoare triple {50567#(< ~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); {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,798 INFO L284 TraceCheckUtils]: 397: Hoare quadruple {49044#true} {50567#(< ~counter~0 47)} #86#return; {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,798 INFO L290 TraceCheckUtils]: 396: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,798 INFO L290 TraceCheckUtils]: 395: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,798 INFO L290 TraceCheckUtils]: 394: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,798 INFO L272 TraceCheckUtils]: 393: Hoare triple {50567#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,799 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {49044#true} {50567#(< ~counter~0 47)} #84#return; {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,799 INFO L290 TraceCheckUtils]: 391: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,799 INFO L290 TraceCheckUtils]: 390: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,799 INFO L290 TraceCheckUtils]: 389: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,799 INFO L272 TraceCheckUtils]: 388: Hoare triple {50567#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,799 INFO L290 TraceCheckUtils]: 387: Hoare triple {50567#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,800 INFO L290 TraceCheckUtils]: 386: Hoare triple {50610#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50567#(< ~counter~0 47)} is VALID [2022-04-27 14:01:03,800 INFO L290 TraceCheckUtils]: 385: Hoare triple {50610#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,800 INFO L290 TraceCheckUtils]: 384: Hoare triple {50610#(< ~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); {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,801 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {49044#true} {50610#(< ~counter~0 46)} #86#return; {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,801 INFO L290 TraceCheckUtils]: 382: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,801 INFO L290 TraceCheckUtils]: 381: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,801 INFO L290 TraceCheckUtils]: 380: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,801 INFO L272 TraceCheckUtils]: 379: Hoare triple {50610#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,801 INFO L284 TraceCheckUtils]: 378: Hoare quadruple {49044#true} {50610#(< ~counter~0 46)} #84#return; {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,801 INFO L290 TraceCheckUtils]: 377: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,802 INFO L290 TraceCheckUtils]: 376: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,802 INFO L290 TraceCheckUtils]: 375: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,802 INFO L272 TraceCheckUtils]: 374: Hoare triple {50610#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,802 INFO L290 TraceCheckUtils]: 373: Hoare triple {50610#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,802 INFO L290 TraceCheckUtils]: 372: Hoare triple {50653#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50610#(< ~counter~0 46)} is VALID [2022-04-27 14:01:03,803 INFO L290 TraceCheckUtils]: 371: Hoare triple {50653#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,803 INFO L290 TraceCheckUtils]: 370: Hoare triple {50653#(< ~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); {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,803 INFO L284 TraceCheckUtils]: 369: Hoare quadruple {49044#true} {50653#(< ~counter~0 45)} #86#return; {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,803 INFO L290 TraceCheckUtils]: 368: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,803 INFO L290 TraceCheckUtils]: 367: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,803 INFO L290 TraceCheckUtils]: 366: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,803 INFO L272 TraceCheckUtils]: 365: Hoare triple {50653#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,804 INFO L284 TraceCheckUtils]: 364: Hoare quadruple {49044#true} {50653#(< ~counter~0 45)} #84#return; {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,804 INFO L290 TraceCheckUtils]: 363: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,804 INFO L290 TraceCheckUtils]: 362: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,804 INFO L290 TraceCheckUtils]: 361: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,804 INFO L272 TraceCheckUtils]: 360: Hoare triple {50653#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,804 INFO L290 TraceCheckUtils]: 359: Hoare triple {50653#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,805 INFO L290 TraceCheckUtils]: 358: Hoare triple {50696#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50653#(< ~counter~0 45)} is VALID [2022-04-27 14:01:03,805 INFO L290 TraceCheckUtils]: 357: Hoare triple {50696#(< ~counter~0 44)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,805 INFO L290 TraceCheckUtils]: 356: Hoare triple {50696#(< ~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); {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,806 INFO L284 TraceCheckUtils]: 355: Hoare quadruple {49044#true} {50696#(< ~counter~0 44)} #86#return; {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,806 INFO L290 TraceCheckUtils]: 354: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,806 INFO L290 TraceCheckUtils]: 353: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,806 INFO L290 TraceCheckUtils]: 352: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,806 INFO L272 TraceCheckUtils]: 351: Hoare triple {50696#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,806 INFO L284 TraceCheckUtils]: 350: Hoare quadruple {49044#true} {50696#(< ~counter~0 44)} #84#return; {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,806 INFO L290 TraceCheckUtils]: 349: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,806 INFO L290 TraceCheckUtils]: 348: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,807 INFO L290 TraceCheckUtils]: 347: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,807 INFO L272 TraceCheckUtils]: 346: Hoare triple {50696#(< ~counter~0 44)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,807 INFO L290 TraceCheckUtils]: 345: Hoare triple {50696#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,807 INFO L290 TraceCheckUtils]: 344: Hoare triple {50739#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50696#(< ~counter~0 44)} is VALID [2022-04-27 14:01:03,808 INFO L290 TraceCheckUtils]: 343: Hoare triple {50739#(< ~counter~0 43)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,808 INFO L290 TraceCheckUtils]: 342: Hoare triple {50739#(< ~counter~0 43)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,808 INFO L284 TraceCheckUtils]: 341: Hoare quadruple {49044#true} {50739#(< ~counter~0 43)} #86#return; {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,808 INFO L290 TraceCheckUtils]: 340: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,808 INFO L290 TraceCheckUtils]: 339: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,808 INFO L290 TraceCheckUtils]: 338: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,808 INFO L272 TraceCheckUtils]: 337: Hoare triple {50739#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,809 INFO L284 TraceCheckUtils]: 336: Hoare quadruple {49044#true} {50739#(< ~counter~0 43)} #84#return; {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,809 INFO L290 TraceCheckUtils]: 335: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,809 INFO L290 TraceCheckUtils]: 334: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,809 INFO L290 TraceCheckUtils]: 333: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,809 INFO L272 TraceCheckUtils]: 332: Hoare triple {50739#(< ~counter~0 43)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,809 INFO L290 TraceCheckUtils]: 331: Hoare triple {50739#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,810 INFO L290 TraceCheckUtils]: 330: Hoare triple {50782#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50739#(< ~counter~0 43)} is VALID [2022-04-27 14:01:03,810 INFO L290 TraceCheckUtils]: 329: Hoare triple {50782#(< ~counter~0 42)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,810 INFO L290 TraceCheckUtils]: 328: Hoare triple {50782#(< ~counter~0 42)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,811 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {49044#true} {50782#(< ~counter~0 42)} #86#return; {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,811 INFO L290 TraceCheckUtils]: 326: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,811 INFO L290 TraceCheckUtils]: 325: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,811 INFO L290 TraceCheckUtils]: 324: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,811 INFO L272 TraceCheckUtils]: 323: Hoare triple {50782#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,811 INFO L284 TraceCheckUtils]: 322: Hoare quadruple {49044#true} {50782#(< ~counter~0 42)} #84#return; {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,811 INFO L290 TraceCheckUtils]: 321: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,811 INFO L290 TraceCheckUtils]: 320: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,812 INFO L290 TraceCheckUtils]: 319: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,812 INFO L272 TraceCheckUtils]: 318: Hoare triple {50782#(< ~counter~0 42)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,812 INFO L290 TraceCheckUtils]: 317: Hoare triple {50782#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,812 INFO L290 TraceCheckUtils]: 316: Hoare triple {50825#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50782#(< ~counter~0 42)} is VALID [2022-04-27 14:01:03,813 INFO L290 TraceCheckUtils]: 315: Hoare triple {50825#(< ~counter~0 41)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,813 INFO L290 TraceCheckUtils]: 314: Hoare triple {50825#(< ~counter~0 41)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,813 INFO L284 TraceCheckUtils]: 313: Hoare quadruple {49044#true} {50825#(< ~counter~0 41)} #86#return; {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,813 INFO L290 TraceCheckUtils]: 312: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,813 INFO L290 TraceCheckUtils]: 311: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,813 INFO L290 TraceCheckUtils]: 310: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,813 INFO L272 TraceCheckUtils]: 309: Hoare triple {50825#(< ~counter~0 41)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,814 INFO L284 TraceCheckUtils]: 308: Hoare quadruple {49044#true} {50825#(< ~counter~0 41)} #84#return; {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,814 INFO L290 TraceCheckUtils]: 307: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,814 INFO L290 TraceCheckUtils]: 306: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,814 INFO L290 TraceCheckUtils]: 305: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,814 INFO L272 TraceCheckUtils]: 304: Hoare triple {50825#(< ~counter~0 41)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,814 INFO L290 TraceCheckUtils]: 303: Hoare triple {50825#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,815 INFO L290 TraceCheckUtils]: 302: Hoare triple {50868#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50825#(< ~counter~0 41)} is VALID [2022-04-27 14:01:03,815 INFO L290 TraceCheckUtils]: 301: Hoare triple {50868#(< ~counter~0 40)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,815 INFO L290 TraceCheckUtils]: 300: Hoare triple {50868#(< ~counter~0 40)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,816 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {49044#true} {50868#(< ~counter~0 40)} #86#return; {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,816 INFO L290 TraceCheckUtils]: 298: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,816 INFO L290 TraceCheckUtils]: 297: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,816 INFO L290 TraceCheckUtils]: 296: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,816 INFO L272 TraceCheckUtils]: 295: Hoare triple {50868#(< ~counter~0 40)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,816 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {49044#true} {50868#(< ~counter~0 40)} #84#return; {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,817 INFO L290 TraceCheckUtils]: 293: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,817 INFO L290 TraceCheckUtils]: 292: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,817 INFO L290 TraceCheckUtils]: 291: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,817 INFO L272 TraceCheckUtils]: 290: Hoare triple {50868#(< ~counter~0 40)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,819 INFO L290 TraceCheckUtils]: 289: Hoare triple {50868#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,820 INFO L290 TraceCheckUtils]: 288: Hoare triple {50911#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50868#(< ~counter~0 40)} is VALID [2022-04-27 14:01:03,820 INFO L290 TraceCheckUtils]: 287: Hoare triple {50911#(< ~counter~0 39)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,820 INFO L290 TraceCheckUtils]: 286: Hoare triple {50911#(< ~counter~0 39)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,821 INFO L284 TraceCheckUtils]: 285: Hoare quadruple {49044#true} {50911#(< ~counter~0 39)} #86#return; {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,821 INFO L290 TraceCheckUtils]: 284: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,821 INFO L290 TraceCheckUtils]: 283: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,821 INFO L290 TraceCheckUtils]: 282: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,821 INFO L272 TraceCheckUtils]: 281: Hoare triple {50911#(< ~counter~0 39)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,822 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {49044#true} {50911#(< ~counter~0 39)} #84#return; {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,822 INFO L290 TraceCheckUtils]: 279: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,822 INFO L290 TraceCheckUtils]: 278: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,822 INFO L290 TraceCheckUtils]: 277: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,822 INFO L272 TraceCheckUtils]: 276: Hoare triple {50911#(< ~counter~0 39)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,823 INFO L290 TraceCheckUtils]: 275: Hoare triple {50911#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,823 INFO L290 TraceCheckUtils]: 274: Hoare triple {50954#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50911#(< ~counter~0 39)} is VALID [2022-04-27 14:01:03,824 INFO L290 TraceCheckUtils]: 273: Hoare triple {50954#(< ~counter~0 38)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,824 INFO L290 TraceCheckUtils]: 272: Hoare triple {50954#(< ~counter~0 38)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,825 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {49044#true} {50954#(< ~counter~0 38)} #86#return; {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,825 INFO L290 TraceCheckUtils]: 270: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,825 INFO L290 TraceCheckUtils]: 269: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,825 INFO L290 TraceCheckUtils]: 268: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,825 INFO L272 TraceCheckUtils]: 267: Hoare triple {50954#(< ~counter~0 38)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,826 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {49044#true} {50954#(< ~counter~0 38)} #84#return; {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,826 INFO L290 TraceCheckUtils]: 265: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,826 INFO L290 TraceCheckUtils]: 264: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,826 INFO L290 TraceCheckUtils]: 263: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,826 INFO L272 TraceCheckUtils]: 262: Hoare triple {50954#(< ~counter~0 38)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,826 INFO L290 TraceCheckUtils]: 261: Hoare triple {50954#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,827 INFO L290 TraceCheckUtils]: 260: Hoare triple {50997#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50954#(< ~counter~0 38)} is VALID [2022-04-27 14:01:03,827 INFO L290 TraceCheckUtils]: 259: Hoare triple {50997#(< ~counter~0 37)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,828 INFO L290 TraceCheckUtils]: 258: Hoare triple {50997#(< ~counter~0 37)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,828 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {49044#true} {50997#(< ~counter~0 37)} #86#return; {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,828 INFO L290 TraceCheckUtils]: 256: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,828 INFO L290 TraceCheckUtils]: 255: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,829 INFO L290 TraceCheckUtils]: 254: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,829 INFO L272 TraceCheckUtils]: 253: Hoare triple {50997#(< ~counter~0 37)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,829 INFO L284 TraceCheckUtils]: 252: Hoare quadruple {49044#true} {50997#(< ~counter~0 37)} #84#return; {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,829 INFO L290 TraceCheckUtils]: 251: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,829 INFO L290 TraceCheckUtils]: 250: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,829 INFO L290 TraceCheckUtils]: 249: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,830 INFO L272 TraceCheckUtils]: 248: Hoare triple {50997#(< ~counter~0 37)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,830 INFO L290 TraceCheckUtils]: 247: Hoare triple {50997#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,831 INFO L290 TraceCheckUtils]: 246: Hoare triple {51040#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50997#(< ~counter~0 37)} is VALID [2022-04-27 14:01:03,831 INFO L290 TraceCheckUtils]: 245: Hoare triple {51040#(< ~counter~0 36)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,831 INFO L290 TraceCheckUtils]: 244: Hoare triple {51040#(< ~counter~0 36)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,832 INFO L284 TraceCheckUtils]: 243: Hoare quadruple {49044#true} {51040#(< ~counter~0 36)} #86#return; {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,832 INFO L290 TraceCheckUtils]: 242: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,832 INFO L290 TraceCheckUtils]: 241: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,832 INFO L290 TraceCheckUtils]: 240: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,832 INFO L272 TraceCheckUtils]: 239: Hoare triple {51040#(< ~counter~0 36)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,833 INFO L284 TraceCheckUtils]: 238: Hoare quadruple {49044#true} {51040#(< ~counter~0 36)} #84#return; {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,833 INFO L290 TraceCheckUtils]: 237: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,833 INFO L290 TraceCheckUtils]: 236: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,833 INFO L290 TraceCheckUtils]: 235: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,833 INFO L272 TraceCheckUtils]: 234: Hoare triple {51040#(< ~counter~0 36)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,833 INFO L290 TraceCheckUtils]: 233: Hoare triple {51040#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,834 INFO L290 TraceCheckUtils]: 232: Hoare triple {51083#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51040#(< ~counter~0 36)} is VALID [2022-04-27 14:01:03,835 INFO L290 TraceCheckUtils]: 231: Hoare triple {51083#(< ~counter~0 35)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,835 INFO L290 TraceCheckUtils]: 230: Hoare triple {51083#(< ~counter~0 35)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,835 INFO L284 TraceCheckUtils]: 229: Hoare quadruple {49044#true} {51083#(< ~counter~0 35)} #86#return; {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 228: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 227: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 226: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L272 TraceCheckUtils]: 225: Hoare triple {51083#(< ~counter~0 35)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L284 TraceCheckUtils]: 224: Hoare quadruple {49044#true} {51083#(< ~counter~0 35)} #84#return; {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 223: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 222: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,836 INFO L290 TraceCheckUtils]: 221: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,837 INFO L272 TraceCheckUtils]: 220: Hoare triple {51083#(< ~counter~0 35)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,837 INFO L290 TraceCheckUtils]: 219: Hoare triple {51083#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,837 INFO L290 TraceCheckUtils]: 218: Hoare triple {51126#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51083#(< ~counter~0 35)} is VALID [2022-04-27 14:01:03,838 INFO L290 TraceCheckUtils]: 217: Hoare triple {51126#(< ~counter~0 34)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,838 INFO L290 TraceCheckUtils]: 216: Hoare triple {51126#(< ~counter~0 34)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,839 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {49044#true} {51126#(< ~counter~0 34)} #86#return; {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,839 INFO L290 TraceCheckUtils]: 214: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,839 INFO L290 TraceCheckUtils]: 213: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,839 INFO L290 TraceCheckUtils]: 212: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,839 INFO L272 TraceCheckUtils]: 211: Hoare triple {51126#(< ~counter~0 34)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,839 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {49044#true} {51126#(< ~counter~0 34)} #84#return; {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,839 INFO L290 TraceCheckUtils]: 209: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,840 INFO L290 TraceCheckUtils]: 208: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,840 INFO L290 TraceCheckUtils]: 207: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,840 INFO L272 TraceCheckUtils]: 206: Hoare triple {51126#(< ~counter~0 34)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,840 INFO L290 TraceCheckUtils]: 205: Hoare triple {51126#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,841 INFO L290 TraceCheckUtils]: 204: Hoare triple {51169#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51126#(< ~counter~0 34)} is VALID [2022-04-27 14:01:03,841 INFO L290 TraceCheckUtils]: 203: Hoare triple {51169#(< ~counter~0 33)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,841 INFO L290 TraceCheckUtils]: 202: Hoare triple {51169#(< ~counter~0 33)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,842 INFO L284 TraceCheckUtils]: 201: Hoare quadruple {49044#true} {51169#(< ~counter~0 33)} #86#return; {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,842 INFO L290 TraceCheckUtils]: 200: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,842 INFO L290 TraceCheckUtils]: 199: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,842 INFO L290 TraceCheckUtils]: 198: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,842 INFO L272 TraceCheckUtils]: 197: Hoare triple {51169#(< ~counter~0 33)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,843 INFO L284 TraceCheckUtils]: 196: Hoare quadruple {49044#true} {51169#(< ~counter~0 33)} #84#return; {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,843 INFO L290 TraceCheckUtils]: 195: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,843 INFO L290 TraceCheckUtils]: 194: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,843 INFO L290 TraceCheckUtils]: 193: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,843 INFO L272 TraceCheckUtils]: 192: Hoare triple {51169#(< ~counter~0 33)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,843 INFO L290 TraceCheckUtils]: 191: Hoare triple {51169#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,844 INFO L290 TraceCheckUtils]: 190: Hoare triple {51212#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51169#(< ~counter~0 33)} is VALID [2022-04-27 14:01:03,844 INFO L290 TraceCheckUtils]: 189: Hoare triple {51212#(< ~counter~0 32)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,845 INFO L290 TraceCheckUtils]: 188: Hoare triple {51212#(< ~counter~0 32)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,845 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {49044#true} {51212#(< ~counter~0 32)} #86#return; {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,845 INFO L290 TraceCheckUtils]: 186: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,845 INFO L290 TraceCheckUtils]: 185: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,845 INFO L290 TraceCheckUtils]: 184: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,846 INFO L272 TraceCheckUtils]: 183: Hoare triple {51212#(< ~counter~0 32)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,846 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {49044#true} {51212#(< ~counter~0 32)} #84#return; {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,846 INFO L290 TraceCheckUtils]: 181: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,846 INFO L290 TraceCheckUtils]: 180: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,846 INFO L290 TraceCheckUtils]: 179: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,846 INFO L272 TraceCheckUtils]: 178: Hoare triple {51212#(< ~counter~0 32)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,847 INFO L290 TraceCheckUtils]: 177: Hoare triple {51212#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,848 INFO L290 TraceCheckUtils]: 176: Hoare triple {50363#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51212#(< ~counter~0 32)} is VALID [2022-04-27 14:01:03,848 INFO L290 TraceCheckUtils]: 175: Hoare triple {50363#(<= ~counter~0 30)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,848 INFO L290 TraceCheckUtils]: 174: Hoare triple {50363#(<= ~counter~0 30)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,849 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {49044#true} {50363#(<= ~counter~0 30)} #86#return; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,849 INFO L290 TraceCheckUtils]: 172: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,849 INFO L290 TraceCheckUtils]: 171: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,849 INFO L290 TraceCheckUtils]: 170: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,849 INFO L272 TraceCheckUtils]: 169: Hoare triple {50363#(<= ~counter~0 30)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,850 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {49044#true} {50363#(<= ~counter~0 30)} #84#return; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,850 INFO L290 TraceCheckUtils]: 167: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,850 INFO L290 TraceCheckUtils]: 166: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,850 INFO L290 TraceCheckUtils]: 165: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,850 INFO L272 TraceCheckUtils]: 164: Hoare triple {50363#(<= ~counter~0 30)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,850 INFO L290 TraceCheckUtils]: 163: Hoare triple {50363#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,851 INFO L290 TraceCheckUtils]: 162: Hoare triple {50320#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50363#(<= ~counter~0 30)} is VALID [2022-04-27 14:01:03,851 INFO L290 TraceCheckUtils]: 161: Hoare triple {50320#(<= ~counter~0 29)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,852 INFO L290 TraceCheckUtils]: 160: Hoare triple {50320#(<= ~counter~0 29)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,852 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {49044#true} {50320#(<= ~counter~0 29)} #86#return; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,852 INFO L290 TraceCheckUtils]: 158: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,852 INFO L290 TraceCheckUtils]: 157: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,852 INFO L290 TraceCheckUtils]: 156: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,853 INFO L272 TraceCheckUtils]: 155: Hoare triple {50320#(<= ~counter~0 29)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,853 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {49044#true} {50320#(<= ~counter~0 29)} #84#return; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,853 INFO L290 TraceCheckUtils]: 153: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,853 INFO L290 TraceCheckUtils]: 152: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,853 INFO L290 TraceCheckUtils]: 151: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,853 INFO L272 TraceCheckUtils]: 150: Hoare triple {50320#(<= ~counter~0 29)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,854 INFO L290 TraceCheckUtils]: 149: Hoare triple {50320#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,855 INFO L290 TraceCheckUtils]: 148: Hoare triple {50277#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50320#(<= ~counter~0 29)} is VALID [2022-04-27 14:01:03,855 INFO L290 TraceCheckUtils]: 147: Hoare triple {50277#(<= ~counter~0 28)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,855 INFO L290 TraceCheckUtils]: 146: Hoare triple {50277#(<= ~counter~0 28)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,856 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {49044#true} {50277#(<= ~counter~0 28)} #86#return; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,856 INFO L290 TraceCheckUtils]: 144: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,856 INFO L290 TraceCheckUtils]: 143: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,856 INFO L290 TraceCheckUtils]: 142: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,856 INFO L272 TraceCheckUtils]: 141: Hoare triple {50277#(<= ~counter~0 28)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,857 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {49044#true} {50277#(<= ~counter~0 28)} #84#return; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,857 INFO L290 TraceCheckUtils]: 139: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,857 INFO L290 TraceCheckUtils]: 138: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,857 INFO L290 TraceCheckUtils]: 137: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,857 INFO L272 TraceCheckUtils]: 136: Hoare triple {50277#(<= ~counter~0 28)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,857 INFO L290 TraceCheckUtils]: 135: Hoare triple {50277#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,858 INFO L290 TraceCheckUtils]: 134: Hoare triple {50234#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50277#(<= ~counter~0 28)} is VALID [2022-04-27 14:01:03,858 INFO L290 TraceCheckUtils]: 133: Hoare triple {50234#(<= ~counter~0 27)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,859 INFO L290 TraceCheckUtils]: 132: Hoare triple {50234#(<= ~counter~0 27)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,859 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {49044#true} {50234#(<= ~counter~0 27)} #86#return; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,859 INFO L290 TraceCheckUtils]: 130: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,859 INFO L290 TraceCheckUtils]: 129: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,859 INFO L290 TraceCheckUtils]: 128: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,859 INFO L272 TraceCheckUtils]: 127: Hoare triple {50234#(<= ~counter~0 27)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,860 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {49044#true} {50234#(<= ~counter~0 27)} #84#return; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,860 INFO L290 TraceCheckUtils]: 125: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,860 INFO L290 TraceCheckUtils]: 124: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,860 INFO L290 TraceCheckUtils]: 123: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,860 INFO L272 TraceCheckUtils]: 122: Hoare triple {50234#(<= ~counter~0 27)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,861 INFO L290 TraceCheckUtils]: 121: Hoare triple {50234#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,861 INFO L290 TraceCheckUtils]: 120: Hoare triple {50191#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50234#(<= ~counter~0 27)} is VALID [2022-04-27 14:01:03,862 INFO L290 TraceCheckUtils]: 119: Hoare triple {50191#(<= ~counter~0 26)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,862 INFO L290 TraceCheckUtils]: 118: Hoare triple {50191#(<= ~counter~0 26)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,863 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {49044#true} {50191#(<= ~counter~0 26)} #86#return; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,863 INFO L290 TraceCheckUtils]: 116: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,863 INFO L290 TraceCheckUtils]: 115: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,863 INFO L290 TraceCheckUtils]: 114: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,863 INFO L272 TraceCheckUtils]: 113: Hoare triple {50191#(<= ~counter~0 26)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,863 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {49044#true} {50191#(<= ~counter~0 26)} #84#return; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,864 INFO L290 TraceCheckUtils]: 111: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,864 INFO L290 TraceCheckUtils]: 109: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,864 INFO L272 TraceCheckUtils]: 108: Hoare triple {50191#(<= ~counter~0 26)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,864 INFO L290 TraceCheckUtils]: 107: Hoare triple {50191#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {50148#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50191#(<= ~counter~0 26)} is VALID [2022-04-27 14:01:03,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {50148#(<= ~counter~0 25)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,865 INFO L290 TraceCheckUtils]: 104: Hoare triple {50148#(<= ~counter~0 25)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,866 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {49044#true} {50148#(<= ~counter~0 25)} #86#return; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,866 INFO L290 TraceCheckUtils]: 102: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,866 INFO L290 TraceCheckUtils]: 101: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,866 INFO L290 TraceCheckUtils]: 100: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,866 INFO L272 TraceCheckUtils]: 99: Hoare triple {50148#(<= ~counter~0 25)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,867 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {49044#true} {50148#(<= ~counter~0 25)} #84#return; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,867 INFO L290 TraceCheckUtils]: 97: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,867 INFO L290 TraceCheckUtils]: 96: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,867 INFO L290 TraceCheckUtils]: 95: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,867 INFO L272 TraceCheckUtils]: 94: Hoare triple {50148#(<= ~counter~0 25)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,867 INFO L290 TraceCheckUtils]: 93: Hoare triple {50148#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,868 INFO L290 TraceCheckUtils]: 92: Hoare triple {50105#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50148#(<= ~counter~0 25)} is VALID [2022-04-27 14:01:03,868 INFO L290 TraceCheckUtils]: 91: Hoare triple {50105#(<= ~counter~0 24)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,868 INFO L290 TraceCheckUtils]: 90: Hoare triple {50105#(<= ~counter~0 24)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,869 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {49044#true} {50105#(<= ~counter~0 24)} #86#return; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,869 INFO L290 TraceCheckUtils]: 88: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,869 INFO L290 TraceCheckUtils]: 87: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,869 INFO L272 TraceCheckUtils]: 85: Hoare triple {50105#(<= ~counter~0 24)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,870 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {49044#true} {50105#(<= ~counter~0 24)} #84#return; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,870 INFO L272 TraceCheckUtils]: 80: Hoare triple {50105#(<= ~counter~0 24)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {50105#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {50062#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50105#(<= ~counter~0 24)} is VALID [2022-04-27 14:01:03,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {50062#(<= ~counter~0 23)} assume !(~r~0 >= ~d~0); {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,872 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {49044#true} {50062#(<= ~counter~0 23)} #82#return; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,872 INFO L290 TraceCheckUtils]: 75: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,872 INFO L272 TraceCheckUtils]: 72: Hoare triple {50062#(<= ~counter~0 23)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,872 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {49044#true} {50062#(<= ~counter~0 23)} #80#return; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L272 TraceCheckUtils]: 67: Hoare triple {50062#(<= ~counter~0 23)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {49044#true} {50062#(<= ~counter~0 23)} #78#return; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 64: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,873 INFO L272 TraceCheckUtils]: 62: Hoare triple {50062#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {50062#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {50019#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {50062#(<= ~counter~0 23)} is VALID [2022-04-27 14:01:03,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {50019#(<= ~counter~0 22)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,875 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {49044#true} {50019#(<= ~counter~0 22)} #82#return; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,875 INFO L272 TraceCheckUtils]: 54: Hoare triple {50019#(<= ~counter~0 22)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,876 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {49044#true} {50019#(<= ~counter~0 22)} #80#return; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,876 INFO L272 TraceCheckUtils]: 49: Hoare triple {50019#(<= ~counter~0 22)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,876 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {49044#true} {50019#(<= ~counter~0 22)} #78#return; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,877 INFO L272 TraceCheckUtils]: 44: Hoare triple {50019#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {50019#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {49976#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {50019#(<= ~counter~0 22)} is VALID [2022-04-27 14:01:03,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {49976#(<= ~counter~0 21)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,879 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {49044#true} {49976#(<= ~counter~0 21)} #82#return; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,879 INFO L272 TraceCheckUtils]: 36: Hoare triple {49976#(<= ~counter~0 21)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,879 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {49044#true} {49976#(<= ~counter~0 21)} #80#return; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L272 TraceCheckUtils]: 31: Hoare triple {49976#(<= ~counter~0 21)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {49044#true} {49976#(<= ~counter~0 21)} #78#return; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,880 INFO L272 TraceCheckUtils]: 26: Hoare triple {49976#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {49976#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {49933#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49976#(<= ~counter~0 21)} is VALID [2022-04-27 14:01:03,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {49933#(<= ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,882 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49044#true} {49933#(<= ~counter~0 20)} #82#return; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,883 INFO L272 TraceCheckUtils]: 18: Hoare triple {49933#(<= ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,883 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {49044#true} {49933#(<= ~counter~0 20)} #80#return; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,883 INFO L272 TraceCheckUtils]: 13: Hoare triple {49933#(<= ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,884 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {49044#true} {49933#(<= ~counter~0 20)} #78#return; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {49044#true} assume true; {49044#true} is VALID [2022-04-27 14:01:03,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {49044#true} assume !(0 == ~cond); {49044#true} is VALID [2022-04-27 14:01:03,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {49044#true} ~cond := #in~cond; {49044#true} is VALID [2022-04-27 14:01:03,884 INFO L272 TraceCheckUtils]: 8: Hoare triple {49933#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {49044#true} is VALID [2022-04-27 14:01:03,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {49933#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {49890#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {49933#(<= ~counter~0 20)} is VALID [2022-04-27 14:01:03,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {49890#(<= ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:03,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {49890#(<= ~counter~0 19)} call #t~ret7 := main(); {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:03,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49890#(<= ~counter~0 19)} {49044#true} #92#return; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:03,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {49890#(<= ~counter~0 19)} assume true; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:03,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {49044#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; {49890#(<= ~counter~0 19)} is VALID [2022-04-27 14:01:03,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {49044#true} call ULTIMATE.init(); {49044#true} is VALID [2022-04-27 14:01:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10230 backedges. 128 proven. 2038 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2022-04-27 14:01:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:01:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460084499] [2022-04-27 14:01:03,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:01:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154987714] [2022-04-27 14:01:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154987714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:01:03,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:01:03,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-04-27 14:01:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578684473] [2022-04-27 14:01:03,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:01:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) Word has length 448 [2022-04-27 14:01:06,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:01:06,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) [2022-04-27 14:01:07,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:01:07,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-27 14:01:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:01:07,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-27 14:01:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-27 14:01:07,056 INFO L87 Difference]: Start difference. First operand 1275 states and 1452 transitions. Second operand has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) [2022-04-27 14:01:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:01:15,273 INFO L93 Difference]: Finished difference Result 2209 states and 2586 transitions. [2022-04-27 14:01:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-27 14:01:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) Word has length 448 [2022-04-27 14:01:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:01:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) [2022-04-27 14:01:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1144 transitions. [2022-04-27 14:01:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) [2022-04-27 14:01:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1144 transitions. [2022-04-27 14:01:15,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 1144 transitions. [2022-04-27 14:01:16,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1144 edges. 1144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:01:16,497 INFO L225 Difference]: With dead ends: 2209 [2022-04-27 14:01:16,497 INFO L226 Difference]: Without dead ends: 2196 [2022-04-27 14:01:16,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 842 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3518, Invalid=6184, Unknown=0, NotChecked=0, Total=9702 [2022-04-27 14:01:16,500 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 1202 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:01:16,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 1398 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 14:01:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2022-04-27 14:01:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2195. [2022-04-27 14:01:18,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:01:18,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2196 states. Second operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) [2022-04-27 14:01:18,284 INFO L74 IsIncluded]: Start isIncluded. First operand 2196 states. Second operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) [2022-04-27 14:01:18,286 INFO L87 Difference]: Start difference. First operand 2196 states. Second operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) [2022-04-27 14:01:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:01:18,467 INFO L93 Difference]: Finished difference Result 2196 states and 2513 transitions. [2022-04-27 14:01:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2513 transitions. [2022-04-27 14:01:18,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:01:18,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:01:18,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) Second operand 2196 states. [2022-04-27 14:01:18,477 INFO L87 Difference]: Start difference. First operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) Second operand 2196 states. [2022-04-27 14:01:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:01:18,674 INFO L93 Difference]: Finished difference Result 2196 states and 2513 transitions. [2022-04-27 14:01:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2513 transitions. [2022-04-27 14:01:18,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:01:18,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:01:18,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:01:18,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:01:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2195 states, 1478 states have (on average 1.1231393775372125) internal successors, (1660), 1525 states have internal predecessors, (1660), 427 states have call successors, (427), 290 states have call predecessors, (427), 289 states have return successors, (425), 379 states have call predecessors, (425), 425 states have call successors, (425) [2022-04-27 14:01:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2512 transitions. [2022-04-27 14:01:18,935 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2512 transitions. Word has length 448 [2022-04-27 14:01:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:01:18,935 INFO L495 AbstractCegarLoop]: Abstraction has 2195 states and 2512 transitions. [2022-04-27 14:01:18,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.7407407407407405) internal successors, (310), 54 states have internal predecessors, (310), 52 states have call successors, (132), 33 states have call predecessors, (132), 32 states have return successors, (130), 50 states have call predecessors, (130), 50 states have call successors, (130) [2022-04-27 14:01:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2512 transitions. [2022-04-27 14:01:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2022-04-27 14:01:18,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:01:18,957 INFO L195 NwaCegarLoop]: trace histogram [105, 104, 104, 47, 46, 46, 46, 46, 46, 46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:01:18,972 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-27 14:01:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:01:19,168 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:01:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:01:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1278553404, now seen corresponding path program 4 times [2022-04-27 14:01:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:01:19,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550891281] [2022-04-27 14:01:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:01:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:01:19,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:01:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174383387] [2022-04-27 14:01:19,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:01:19,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:01:19,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:01:19,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:01:19,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process