/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:41:11,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:41:11,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:41:11,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:41:11,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:41:11,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:41:11,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:41:11,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:41:11,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:41:11,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:41:11,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:41:11,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:41:11,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:41:11,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:41:11,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:41:11,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:41:11,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:41:11,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:41:11,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:41:11,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:41:11,269 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:41:11,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:41:11,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:41:11,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:41:11,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:41:11,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:41:11,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:41:11,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:41:11,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:41:11,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:41:11,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:41:11,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:41:11,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:41:11,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:41:11,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:41:11,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:41:11,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:41:11,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:41:11,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:41:11,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:41:11,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:41:11,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:41:11,293 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:41:11,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:41:11,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:41:11,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:41:11,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:41:11,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:41:11,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:41:11,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:41:11,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:41:11,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:41:11,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:41:11,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:41:11,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:41:11,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:41:11,319 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:41:11,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:41:11,320 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:41:11,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:41:11,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:41:11,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:41:11,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:41:11,567 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:41:11,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound10.c [2022-04-27 13:41:11,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54b1944/f51ba95557684d229b0ef327352b1fd1/FLAG126cce8bf [2022-04-27 13:41:12,059 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:41:12,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound10.c [2022-04-27 13:41:12,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54b1944/f51ba95557684d229b0ef327352b1fd1/FLAG126cce8bf [2022-04-27 13:41:12,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54b1944/f51ba95557684d229b0ef327352b1fd1 [2022-04-27 13:41:12,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:41:12,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:41:12,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:41:12,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:41:12,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:41:12,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f21e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12, skipping insertion in model container [2022-04-27 13:41:12,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:41:12,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:41:12,296 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_unwindbound10.c[526,539] [2022-04-27 13:41:12,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:41:12,339 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:41:12,358 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_unwindbound10.c[526,539] [2022-04-27 13:41:12,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:41:12,378 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:41:12,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12 WrapperNode [2022-04-27 13:41:12,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:41:12,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:41:12,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:41:12,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:41:12,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:41:12,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:41:12,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:41:12,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:41:12,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (1/1) ... [2022-04-27 13:41:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:41:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:12,441 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:41:12,463 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:41:12,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:41:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:41:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:41:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:41:12,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:41:12,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:41:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:41:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:41:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:41:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:41:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:41:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:41:12,558 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:41:12,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:41:12,765 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:41:12,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:41:12,771 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:41:12,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:41:12 BoogieIcfgContainer [2022-04-27 13:41:12,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:41:12,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:41:12,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:41:12,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:41:12,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:41:12" (1/3) ... [2022-04-27 13:41:12,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3098135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:41:12, skipping insertion in model container [2022-04-27 13:41:12,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:41:12" (2/3) ... [2022-04-27 13:41:12,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3098135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:41:12, skipping insertion in model container [2022-04-27 13:41:12,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:41:12" (3/3) ... [2022-04-27 13:41:12,793 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound10.c [2022-04-27 13:41:12,806 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:41:12,807 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:41:12,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:41:12,885 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@1e1b90b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e926155 [2022-04-27 13:41:12,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:41:12,895 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:41:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:41:12,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:12,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:41:12,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:12,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-27 13:41:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:12,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701177316] [2022-04-27 13:41:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:13,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:41:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:13,152 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:41:13,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:41:13,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:41:13,157 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:41:13,157 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:41:13,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:41:13,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:41:13,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:41:13,158 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:41:13,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 13:41:13,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:41:13,160 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:41:13,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:41:13,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:41:13,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:41:13,161 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:41:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:13,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701177316] [2022-04-27 13:41:13,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701177316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:13,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:13,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:41:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605295547] [2022-04-27 13:41:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:13,173 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:41:13,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:13,179 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:41:13,209 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:41:13,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:41:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:41:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:41:13,235 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:41:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:13,446 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-27 13:41:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:41:13,447 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:41:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:13,449 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:41:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:41:13,466 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:41:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:41:13,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-27 13:41:13,594 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:41:13,605 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:41:13,606 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:41:13,610 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:41:13,614 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:41:13,615 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:41:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:41:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 13:41:13,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:13,655 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:41:13,656 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:41:13,657 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:41:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:13,663 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:41:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:41:13,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:13,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:13,666 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:41:13,667 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:41:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:13,674 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:41:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:41:13,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:13,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:13,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:13,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:13,677 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:41:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-27 13:41:13,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-27 13:41:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:13,684 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-27 13:41:13,685 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:41:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-27 13:41:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:41:13,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:13,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:41:13,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:41:13,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-27 13:41:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069165560] [2022-04-27 13:41:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:41:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:13,782 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:41:13,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:41:13,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:41:13,783 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:41:13,784 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:41:13,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:41:13,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:41:13,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-27 13:41:13,785 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:41:13,785 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:41:13,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} assume !!(#t~post5 < 10);havoc #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:41:13,786 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:41:13,787 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:41:13,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-27 13:41:13,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 13:41:13,788 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:41:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:13,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069165560] [2022-04-27 13:41:13,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069165560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:13,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:13,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:41:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155088524] [2022-04-27 13:41:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:13,790 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:41:13,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:13,791 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:41:13,801 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:41:13,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:41:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:41:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:41:13,803 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:41:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,246 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-27 13:41:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:41:14,247 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:41:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:14,248 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:41:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:41:14,253 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:41:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:41:14,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:41:14,315 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:41:14,319 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:41:14,319 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 13:41:14,323 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:41:14,325 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:41:14,325 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.2s Time] [2022-04-27 13:41:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 13:41:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 13:41:14,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:14,342 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:41:14,343 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:41:14,343 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:41:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,349 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:41:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:41:14,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:14,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:14,356 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:41:14,358 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:41:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,361 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:41:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:41:14,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:14,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:14,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:14,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:14,363 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:41:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 13:41:14,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-27 13:41:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 13:41:14,369 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:41:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 13:41:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 13:41:14,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:14,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:41:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:41:14,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-27 13:41:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:14,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750217059] [2022-04-27 13:41:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:41:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:14,474 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:41:14,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:14,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:14,475 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:41:14,476 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:41:14,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:14,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:14,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:14,478 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:41:14,479 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:41:14,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {417#false} is VALID [2022-04-27 13:41:14,480 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:41:14,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 10);havoc #t~post6; {417#false} is VALID [2022-04-27 13:41:14,480 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:41:14,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 13:41:14,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 13:41:14,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 13:41:14,482 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:41:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750217059] [2022-04-27 13:41:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750217059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:14,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:14,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:41:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363252519] [2022-04-27 13:41:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:41:14,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:14,488 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:41:14,500 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:41:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:41:14,502 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:41:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,716 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-27 13:41:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:41:14,717 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:41:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:14,717 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:41:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:41:14,721 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:41:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:41:14,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-27 13:41:14,784 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:41:14,787 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:41:14,787 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:41:14,790 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:41:14,795 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:41:14,796 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:41:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:41:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:41:14,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:14,806 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:41:14,807 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:41:14,807 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:41:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,809 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:41:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:41:14,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:14,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:14,810 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:41:14,810 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:41:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:14,813 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:41:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:41:14,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:14,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:14,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:14,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:14,814 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:41:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:41:14,815 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-27 13:41:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:14,816 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:41:14,816 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:41:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:41:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 13:41:14,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:14,817 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:41:14,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:41:14,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-27 13:41:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506028485] [2022-04-27 13:41:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:41:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:14,876 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:41:14,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:41:14,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:41:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 13:41:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:14,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:41:14,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:41:14,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:41:14,884 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:41:14,884 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:41:14,885 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:41:14,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:41:14,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:41:14,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-27 13:41:14,885 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:41:14,886 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:41:14,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 10);havoc #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:41:14,886 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:41:14,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:41:14,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:41:14,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:41:14,887 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:41:14,888 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:41:14,889 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:41:14,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:41:14,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:41:14,889 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:41:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:14,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506028485] [2022-04-27 13:41:14,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506028485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:14,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:14,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:41:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227015090] [2022-04-27 13:41:14,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:14,891 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:41:14,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:14,891 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:41:14,904 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:41:14,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:41:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:41:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:41:14,905 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:41:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,220 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:41:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:41:15,221 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:41:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:15,221 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:41:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:41:15,223 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:41:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:41:15,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:41:15,284 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:41:15,285 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:41:15,285 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:41:15,286 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:41:15,286 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:41:15,287 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:41:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:41:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-27 13:41:15,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:15,294 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:41:15,295 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:41:15,295 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:41:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,298 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:41:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:41:15,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:15,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:15,299 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:41:15,299 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:41:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,302 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:41:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:41:15,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:15,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:15,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:15,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:15,303 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:41:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-27 13:41:15,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-27 13:41:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:15,304 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-27 13:41:15,305 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:41:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-27 13:41:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:41:15,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:15,305 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:41:15,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:41:15,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-27 13:41:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:15,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778852232] [2022-04-27 13:41:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:15,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933872682] [2022-04-27 13:41:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:15,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:15,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:15,331 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:41:15,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:41:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:41:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:15,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:15,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-27 13:41:15,632 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:41:15,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:41:15,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-27 13:41:15,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-27 13:41:15,637 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:41:15,637 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:41:15,638 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 < 10);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:41:15,638 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:41:15,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:41:15,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:41:15,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:41:15,641 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:41:15,641 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:41:15,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:41:15,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:41:15,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:41:15,645 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:41:15,646 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:41:15,646 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:41:15,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-27 13:41:15,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-27 13:41:15,647 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:41:15,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:41:15,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778852232] [2022-04-27 13:41:15,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:15,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933872682] [2022-04-27 13:41:15,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933872682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:15,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:15,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:41:15,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912470029] [2022-04-27 13:41:15,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:15,649 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:41:15,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:15,650 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:41:15,672 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:41:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:41:15,673 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:41:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,859 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 13:41:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:41:15,859 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:41:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:15,860 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:41:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:41:15,863 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:41:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:41:15,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 13:41:15,936 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:41:15,937 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:41:15,937 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:41:15,938 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:41:15,939 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:41:15,939 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:41:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:41:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 13:41:15,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:15,958 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:41:15,962 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:41:15,962 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:41:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,966 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:41:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:41:15,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:15,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:15,968 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:41:15,968 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:41:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:15,972 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:41:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:41:15,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:15,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:15,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:15,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:15,974 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:41:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:41:15,976 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-27 13:41:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:15,977 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:41:15,977 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:41:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:41:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:41:15,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:15,978 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:41:15,998 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:41:16,181 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:41:16,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-27 13:41:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:16,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520764660] [2022-04-27 13:41:16,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:16,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671863881] [2022-04-27 13:41:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:16,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:16,198 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:41:16,205 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:41:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:16,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:41:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:16,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:16,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 13:41:16,500 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:41:16,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:16,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:16,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:16,502 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:41:16,503 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:41:16,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,504 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:41:16,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,506 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:41:16,506 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:41:16,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,508 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:41:16,509 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:41:16,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:16,517 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:41:16,517 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:41:16,518 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:41:16,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1174#false} is VALID [2022-04-27 13:41:16,519 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:41:16,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 13:41:16,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 13:41:16,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 13:41:16,519 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:41:16,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:41:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:16,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520764660] [2022-04-27 13:41:16,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:16,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671863881] [2022-04-27 13:41:16,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671863881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:16,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:16,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:41:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766719719] [2022-04-27 13:41:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:16,521 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:41:16,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:16,521 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:41:16,538 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:41:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:16,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:16,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:41:16,539 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:41:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:16,633 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 13:41:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:41:16,634 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:41:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:16,634 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:41:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:41:16,636 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:41:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:41:16,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:41:16,678 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:41:16,680 INFO L225 Difference]: With dead ends: 70 [2022-04-27 13:41:16,681 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:41:16,682 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:41:16,686 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:41:16,686 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:41:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:41:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:41:16,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:16,711 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:41:16,711 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:41:16,712 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:41:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:16,715 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:41:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:41:16,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:16,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:16,717 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:41:16,718 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:41:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:16,720 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:41:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:41:16,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:16,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:16,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:16,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:16,722 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:41:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 13:41:16,726 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-27 13:41:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:16,727 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 13:41:16,727 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:41:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 13:41:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:41:16,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:16,728 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:41:16,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 13:41:16,939 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:41:16,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-27 13:41:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:16,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87953488] [2022-04-27 13:41:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:16,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622407408] [2022-04-27 13:41:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:16,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:41:16,965 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:41:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:17,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:41:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:17,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:19,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-27 13:41:19,631 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:41:19,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:41:19,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-27 13:41:19,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-27 13:41:19,644 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:41:19,644 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:41:19,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:41:19,645 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:41:19,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:41:19,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:41:19,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:41:19,646 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:41:19,646 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:41:19,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:41:19,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:41:19,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:41:19,647 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:41:19,648 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:41:19,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:41:19,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:41:19,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:41:19,649 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:41:19,649 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:41:19,650 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:41:19,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:41:19,651 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:41:19,652 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:41:19,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-27 13:41:19,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-27 13:41:19,653 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:41:19,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:41:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87953488] [2022-04-27 13:41:19,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622407408] [2022-04-27 13:41:19,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622407408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:19,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:41:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953768905] [2022-04-27 13:41:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:19,654 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:41:19,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:19,655 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:41:19,679 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:41:19,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:19,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:19,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:41:19,681 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:41:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:19,880 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 13:41:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:41:19,880 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:41:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:19,881 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:41:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:41:19,882 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:41:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:41:19,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 13:41:19,928 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:41:19,930 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:41:19,930 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:41:19,931 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:41:19,931 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:41:19,931 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:41:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:41:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 13:41:19,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:19,958 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:41:19,958 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:41:19,958 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:41:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:19,962 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:41:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:41:19,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:19,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:19,963 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:41:19,963 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:41:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:19,967 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:41:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:41:19,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:19,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:19,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:19,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:19,971 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:41:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 13:41:19,973 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-27 13:41:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:19,974 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 13:41:19,974 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:41:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:41:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:41:19,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:19,977 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:41:20,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:41:20,197 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:41:20,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-27 13:41:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:20,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188144163] [2022-04-27 13:41:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:20,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090733510] [2022-04-27 13:41:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:20,221 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:41:20,222 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:41:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:41:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:20,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:20,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:41:20,447 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:41:20,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:20,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:20,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:20,448 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:41:20,449 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:41:20,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,450 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:41:20,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,452 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:41:20,452 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:41:20,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,454 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:41:20,454 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:41:20,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:20,456 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:41:20,456 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:41:20,457 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:41:20,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:41:20,457 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:41:20,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 10);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:41:20,457 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:41:20,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:41:20,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-27 13:41:20,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-27 13:41:20,458 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:41:20,458 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:41:20,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:41:20,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:41:20,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:41:20,459 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:41:20,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:41:20,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:41:20,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:41:20,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:41:20,679 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:41:20,679 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:41:20,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:41:20,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:41:20,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:41:20,680 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:41:20,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 10);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:41:20,680 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:41:20,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:41:20,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2149#(< |main_#t~post5| 10)} is VALID [2022-04-27 13:41:20,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {2153#(< ~counter~0 10)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,687 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2153#(< ~counter~0 10)} #82#return; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:41:20,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:41:20,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:41:20,688 INFO L272 TraceCheckUtils]: 18: Hoare triple {2153#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:41:20,688 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2153#(< ~counter~0 10)} #80#return; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:41:20,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:41:20,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:41:20,689 INFO L272 TraceCheckUtils]: 13: Hoare triple {2153#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:41:20,689 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2153#(< ~counter~0 10)} #78#return; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:41:20,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:41:20,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:41:20,690 INFO L272 TraceCheckUtils]: 8: Hoare triple {2153#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:41:20,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {2153#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {2208#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2153#(< ~counter~0 10)} is VALID [2022-04-27 13:41:20,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {2208#(< ~counter~0 9)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2208#(< ~counter~0 9)} is VALID [2022-04-27 13:41:20,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2208#(< ~counter~0 9)} call #t~ret7 := main(); {2208#(< ~counter~0 9)} is VALID [2022-04-27 13:41:20,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2208#(< ~counter~0 9)} {2000#true} #92#return; {2208#(< ~counter~0 9)} is VALID [2022-04-27 13:41:20,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {2208#(< ~counter~0 9)} assume true; {2208#(< ~counter~0 9)} is VALID [2022-04-27 13:41:20,693 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 9)} is VALID [2022-04-27 13:41:20,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:41:20,694 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:41:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188144163] [2022-04-27 13:41:20,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090733510] [2022-04-27 13:41:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090733510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:41:20,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:41:20,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:41:20,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154329929] [2022-04-27 13:41:20,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:41:20,695 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:41:20,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:20,696 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:41:20,741 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:41:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:41:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:20,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:41:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:41:20,743 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:41:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:21,031 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2022-04-27 13:41:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:41:21,032 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:41:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:21,032 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:41:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:41:21,035 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:41:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-27 13:41:21,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-27 13:41:21,142 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:41:21,145 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:41:21,145 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:41:21,145 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:41:21,146 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:41:21,146 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:41:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:41:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-27 13:41:21,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:21,185 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:41:21,186 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:41:21,188 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:41:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:21,194 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:41:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:41:21,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:21,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:21,196 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:41:21,196 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:41:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:21,201 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2022-04-27 13:41:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2022-04-27 13:41:21,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:21,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:21,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:21,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:21,203 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:41:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-27 13:41:21,207 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 37 [2022-04-27 13:41:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:21,208 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-27 13:41:21,209 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:41:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 13:41:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:41:21,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:21,210 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:41:21,237 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:41:21,423 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:41:21,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-27 13:41:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557071622] [2022-04-27 13:41:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:21,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:21,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872880056] [2022-04-27 13:41:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:21,437 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:41:21,455 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:41:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:21,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:41:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:21,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:21,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:41:21,742 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:41:21,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:41:21,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:41:21,743 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:41:21,743 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:41:21,743 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 < 10);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:41:21,743 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:41:21,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:21,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:21,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,744 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:41:21,745 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:41:21,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:21,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:21,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,750 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:41:21,750 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:41:21,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:21,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:21,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,762 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:41:21,763 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:41:21,764 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:41:21,766 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 < 10);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:41:21,766 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:41:21,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:21,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:21,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,771 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:41:21,771 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:41:21,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:21,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:21,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:21,772 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:41:21,773 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:41:21,773 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:41:21,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:41:21,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:41:21,774 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:41:21,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:41:22,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {2831#false} assume !false; {2831#false} is VALID [2022-04-27 13:41:22,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2831#false} is VALID [2022-04-27 13:41:22,017 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:41:22,018 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:41:22,024 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:41:22,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:22,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:22,024 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:41:22,025 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:41:22,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:22,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:22,025 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:41:22,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 10);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:41:22,026 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:41:22,029 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:41:22,029 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:41:22,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:22,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:22,030 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:41:22,030 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:41:22,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:22,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:22,031 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:41:22,031 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:41:22,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#true} assume !(0 == ~cond); {2830#true} is VALID [2022-04-27 13:41:22,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {2830#true} ~cond := #in~cond; {2830#true} is VALID [2022-04-27 13:41:22,032 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:41:22,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 10);havoc #t~post5; {2965#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:41:22,033 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:41:22,033 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:41:22,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {2830#true} call #t~ret7 := main(); {2830#true} is VALID [2022-04-27 13:41:22,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2830#true} {2830#true} #92#return; {2830#true} is VALID [2022-04-27 13:41:22,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2830#true} assume true; {2830#true} is VALID [2022-04-27 13:41:22,034 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:41:22,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {2830#true} call ULTIMATE.init(); {2830#true} is VALID [2022-04-27 13:41:22,034 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:41:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557071622] [2022-04-27 13:41:22,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872880056] [2022-04-27 13:41:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872880056] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:41:22,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:41:22,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:41:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881148212] [2022-04-27 13:41:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:22,035 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:41:22,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:22,036 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:41:22,054 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:41:22,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:41:22,055 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:41:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:24,317 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-04-27 13:41:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:41:24,318 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:41:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:24,318 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:41:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:41:24,319 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:41:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:41:24,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:41:24,369 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:41:24,372 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:41:24,372 INFO L226 Difference]: Without dead ends: 125 [2022-04-27 13:41:24,373 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:41:24,373 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:41:24,374 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:41:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-27 13:41:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-04-27 13:41:24,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:24,410 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:41:24,411 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:41:24,411 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:41:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:24,415 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:41:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:41:24,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:24,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:24,416 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:41:24,416 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:41:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:24,420 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-04-27 13:41:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-04-27 13:41:24,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:24,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:24,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:24,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:24,421 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:41:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-04-27 13:41:24,424 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 40 [2022-04-27 13:41:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:24,424 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-04-27 13:41:24,425 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:41:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-04-27 13:41:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 13:41:24,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:24,425 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:41:24,452 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:41:24,640 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:41:24,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-27 13:41:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:24,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941285438] [2022-04-27 13:41:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:24,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:24,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177626710] [2022-04-27 13:41:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:24,654 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:41:24,666 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:41:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:24,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:41:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:24,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:24,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:41:24,969 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:41:24,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#(<= ~counter~0 0)} assume true; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:24,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#(<= ~counter~0 0)} {3681#true} #92#return; {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:24,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#(<= ~counter~0 0)} call #t~ret7 := main(); {3689#(<= ~counter~0 0)} is VALID [2022-04-27 13:41:24,970 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:41:24,971 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:41:24,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {3705#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,971 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:41:24,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,973 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:41:24,973 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:41:24,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,987 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:41:24,988 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:41:24,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {3705#(<= ~counter~0 1)} ~cond := #in~cond; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {3705#(<= ~counter~0 1)} assume !(0 == ~cond); {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {3705#(<= ~counter~0 1)} assume true; {3705#(<= ~counter~0 1)} is VALID [2022-04-27 13:41:24,990 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:41:24,990 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:41:24,991 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:41:24,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,992 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:41:24,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,994 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:41:24,995 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:41:24,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,996 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:41:24,997 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:41:24,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(<= ~counter~0 2)} ~cond := #in~cond; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(<= ~counter~0 2)} assume !(0 == ~cond); {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(<= ~counter~0 2)} assume true; {3760#(<= ~counter~0 2)} is VALID [2022-04-27 13:41:24,998 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:41:24,999 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:41:24,999 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:41:25,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:41:25,000 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:41:25,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:41:25,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !(0 == ~cond); {3682#false} is VALID [2022-04-27 13:41:25,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {3682#false} assume true; {3682#false} is VALID [2022-04-27 13:41:25,000 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3682#false} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:41:25,000 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:41:25,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:41:25,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:41:25,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:41:25,001 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:41:25,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:41:25,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2022-04-27 13:41:25,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2022-04-27 13:41:25,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2022-04-27 13:41:25,256 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:41:25,256 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3681#true} {3682#false} #88#return; {3682#false} is VALID [2022-04-27 13:41:25,256 INFO L290 TraceCheckUtils]: 47: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,256 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:41:25,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {3873#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3682#false} is VALID [2022-04-27 13:41:25,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {3877#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3873#(< |main_#t~post6| 10)} is VALID [2022-04-27 13:41:25,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {3877#(< ~counter~0 10)} assume !(~r~0 >= ~d~0); {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,259 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3681#true} {3877#(< ~counter~0 10)} #82#return; {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,263 INFO L272 TraceCheckUtils]: 36: Hoare triple {3877#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,264 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3681#true} {3877#(< ~counter~0 10)} #80#return; {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,265 INFO L272 TraceCheckUtils]: 31: Hoare triple {3877#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,265 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3681#true} {3877#(< ~counter~0 10)} #78#return; {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,267 INFO L272 TraceCheckUtils]: 26: Hoare triple {3877#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {3877#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {3932#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3877#(< ~counter~0 10)} is VALID [2022-04-27 13:41:25,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {3932#(< ~counter~0 9)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,269 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3681#true} {3932#(< ~counter~0 9)} #82#return; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,269 INFO L272 TraceCheckUtils]: 18: Hoare triple {3932#(< ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,270 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3681#true} {3932#(< ~counter~0 9)} #80#return; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,270 INFO L272 TraceCheckUtils]: 13: Hoare triple {3932#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,271 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3681#true} {3932#(< ~counter~0 9)} #78#return; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#true} assume true; {3681#true} is VALID [2022-04-27 13:41:25,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0 == ~cond); {3681#true} is VALID [2022-04-27 13:41:25,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {3681#true} ~cond := #in~cond; {3681#true} is VALID [2022-04-27 13:41:25,271 INFO L272 TraceCheckUtils]: 8: Hoare triple {3932#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3681#true} is VALID [2022-04-27 13:41:25,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {3932#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {3987#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3932#(< ~counter~0 9)} is VALID [2022-04-27 13:41:25,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {3987#(< ~counter~0 8)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3987#(< ~counter~0 8)} is VALID [2022-04-27 13:41:25,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {3987#(< ~counter~0 8)} call #t~ret7 := main(); {3987#(< ~counter~0 8)} is VALID [2022-04-27 13:41:25,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3987#(< ~counter~0 8)} {3681#true} #92#return; {3987#(< ~counter~0 8)} is VALID [2022-04-27 13:41:25,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {3987#(< ~counter~0 8)} assume true; {3987#(< ~counter~0 8)} is VALID [2022-04-27 13:41:25,274 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 8)} is VALID [2022-04-27 13:41:25,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2022-04-27 13:41:25,274 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:41:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:25,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941285438] [2022-04-27 13:41:25,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:25,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177626710] [2022-04-27 13:41:25,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177626710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:41:25,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:41:25,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:41:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955046443] [2022-04-27 13:41:25,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:41:25,277 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:41:25,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:25,277 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:41:25,328 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:41:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:41:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:41:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:41:25,329 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:41:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:25,899 INFO L93 Difference]: Finished difference Result 245 states and 298 transitions. [2022-04-27 13:41:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:41:25,899 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:41:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:25,899 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:41:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:41:25,902 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:41:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-27 13:41:25,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-27 13:41:26,032 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:41:26,038 INFO L225 Difference]: With dead ends: 245 [2022-04-27 13:41:26,038 INFO L226 Difference]: Without dead ends: 224 [2022-04-27 13:41:26,039 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:41:26,039 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 100 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:41:26,039 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.2s Time] [2022-04-27 13:41:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-27 13:41:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 217. [2022-04-27 13:41:26,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:26,104 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:41:26,105 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:41:26,105 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:41:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:26,112 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:41:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:41:26,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:26,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:26,113 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:41:26,114 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:41:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:26,120 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-04-27 13:41:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2022-04-27 13:41:26,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:26,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:26,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:26,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:26,121 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:41:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2022-04-27 13:41:26,128 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 53 [2022-04-27 13:41:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:26,128 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2022-04-27 13:41:26,128 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:41:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2022-04-27 13:41:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 13:41:26,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:26,129 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:41:26,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 13:41:26,343 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:41:26,344 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-27 13:41:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:26,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76403632] [2022-04-27 13:41:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:26,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:26,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041526533] [2022-04-27 13:41:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:26,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:26,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:26,358 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:41:26,371 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:41:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:26,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:41:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:26,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:26,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:41:26,936 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:41:26,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:41:26,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:41:26,936 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:41:26,937 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:41:26,937 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 < 10);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:41:26,937 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:41:26,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,939 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:41:26,939 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:41:26,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,940 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:41:26,940 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:41:26,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,941 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:41:26,942 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:41:26,942 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:41:26,943 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 < 10);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:41:26,943 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:41:26,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,944 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:41:26,944 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:41:26,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,945 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:41:26,945 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:41:26,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,946 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:41:26,946 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:41:26,947 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:41:26,947 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 < 10);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:41:26,947 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:41:26,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,948 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:41:26,948 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:41:26,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:26,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:26,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:26,949 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:41:26,950 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:41:26,951 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:41:26,951 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:41:26,951 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 < 10);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:41:26,952 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:41:26,953 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:41:26,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:41:26,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:41:26,953 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:41:26,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:41:28,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {5105#false} assume !false; {5105#false} is VALID [2022-04-27 13:41:28,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {5290#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5105#false} is VALID [2022-04-27 13:41:28,434 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:41:28,435 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:41:28,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5306#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:41:28,436 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:41:28,450 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:41:28,472 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:41:28,473 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:41:28,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,474 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:41:28,475 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:41:28,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,475 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:41:28,477 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 < 10);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:41:28,478 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:41:28,479 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:41:28,480 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:41:28,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,480 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:41:28,481 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:41:28,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,481 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:41:28,484 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:41:28,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,484 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:41:28,486 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 < 10);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:41:28,487 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:41:28,496 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:41:28,497 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:41:28,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,497 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:41:28,498 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:41:28,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,498 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:41:28,499 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:41:28,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {5104#true} assume !(0 == ~cond); {5104#true} is VALID [2022-04-27 13:41:28,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#true} ~cond := #in~cond; {5104#true} is VALID [2022-04-27 13:41:28,500 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:41:28,500 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 < 10);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:41:28,501 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:41:28,501 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:41:28,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {5104#true} call #t~ret7 := main(); {5104#true} is VALID [2022-04-27 13:41:28,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5104#true} {5104#true} #92#return; {5104#true} is VALID [2022-04-27 13:41:28,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#true} assume true; {5104#true} is VALID [2022-04-27 13:41:28,501 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:41:28,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {5104#true} call ULTIMATE.init(); {5104#true} is VALID [2022-04-27 13:41:28,502 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:41:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:28,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76403632] [2022-04-27 13:41:28,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:28,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041526533] [2022-04-27 13:41:28,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041526533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:41:28,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:41:28,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:41:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6552230] [2022-04-27 13:41:28,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:41:28,504 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:41:28,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:28,504 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:41:28,624 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:41:28,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:41:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:41:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:41:28,626 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:41:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:32,377 INFO L93 Difference]: Finished difference Result 371 states and 479 transitions. [2022-04-27 13:41:32,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:41:32,378 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:41:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:32,378 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:41:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:41:32,381 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:41:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2022-04-27 13:41:32,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 153 transitions. [2022-04-27 13:41:32,657 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:41:32,665 INFO L225 Difference]: With dead ends: 371 [2022-04-27 13:41:32,666 INFO L226 Difference]: Without dead ends: 303 [2022-04-27 13:41:32,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:41:32,667 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:41:32,667 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:41:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-27 13:41:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 274. [2022-04-27 13:41:32,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:32,772 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:41:32,772 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:41:32,773 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:41:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:32,782 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:41:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:41:32,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:32,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:32,784 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:41:32,784 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:41:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:32,793 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-04-27 13:41:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2022-04-27 13:41:32,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:32,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:32,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:32,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:32,795 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:41:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2022-04-27 13:41:32,803 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 62 [2022-04-27 13:41:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:32,804 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2022-04-27 13:41:32,804 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:41:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2022-04-27 13:41:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:41:32,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:32,805 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:41:32,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 13:41:33,019 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:41:33,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-27 13:41:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:33,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579322388] [2022-04-27 13:41:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:33,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:33,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481003102] [2022-04-27 13:41:33,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:33,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:33,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:33,039 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:41:33,049 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:41:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:33,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:41:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:33,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:33,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:41:33,888 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:41:33,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:41:33,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:41:33,888 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:41:33,889 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:41:33,889 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 < 10);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:41:33,889 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:41:33,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,890 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:41:33,890 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:41:33,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,891 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:41:33,891 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:41:33,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,892 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:41:33,893 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:41:33,893 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:41:33,894 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 < 10);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:41:33,894 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:41:33,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,895 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:41:33,895 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:41:33,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,895 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:41:33,895 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:41:33,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,897 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:41:33,898 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:41:33,898 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:41:33,898 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 < 10);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:41:33,899 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:41:33,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,899 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:41:33,899 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:41:33,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:33,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:33,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:33,900 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:41:33,901 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:41:33,901 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:41:33,902 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:41:33,902 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 < 10);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:41:33,902 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:41:33,903 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:41:33,903 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:41:33,903 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:41:33,904 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:41:33,904 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:41:33,904 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:41:33,905 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:41:33,905 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:41:33,906 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:41:33,907 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:41:33,907 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:41:33,908 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:41:33,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:41:33,908 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:41:33,908 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:41:33,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:41:44,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {6982#false} assume !false; {6982#false} is VALID [2022-04-27 13:41:44,575 INFO L290 TraceCheckUtils]: 71: Hoare triple {7205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6982#false} is VALID [2022-04-27 13:41:44,575 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:41:44,576 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:41:44,576 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:41:44,577 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:41:44,578 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:41:44,578 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:41:44,578 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:41:44,578 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:41:44,582 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:41:44,582 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:41:44,583 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:41:44,583 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:41:44,583 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:41:44,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {6981#true} assume !!(#t~post6 < 10);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:41:44,584 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:41:44,584 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:41:44,584 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:41:44,584 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6981#true} {6981#true} #86#return; {6981#true} is VALID [2022-04-27 13:41:44,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,584 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:41:44,584 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6981#true} {6981#true} #84#return; {6981#true} is VALID [2022-04-27 13:41:44,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,585 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:41:44,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {6981#true} assume !!(#t~post6 < 10);havoc #t~post6; {6981#true} is VALID [2022-04-27 13:41:44,585 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:41:44,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {6981#true} assume !(~r~0 >= ~d~0); {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,585 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:41:44,585 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:41:44,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,586 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:41:44,586 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:41:44,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,586 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:41:44,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {6981#true} assume !!(#t~post5 < 10);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:41:44,586 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:41:44,586 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:41:44,587 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6981#true} {6981#true} #82#return; {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,587 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:41:44,587 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6981#true} {6981#true} #80#return; {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,587 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:41:44,587 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6981#true} {6981#true} #78#return; {6981#true} is VALID [2022-04-27 13:41:44,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {6981#true} assume !(0 == ~cond); {6981#true} is VALID [2022-04-27 13:41:44,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {6981#true} ~cond := #in~cond; {6981#true} is VALID [2022-04-27 13:41:44,588 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:41:44,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#true} assume !!(#t~post5 < 10);havoc #t~post5; {6981#true} is VALID [2022-04-27 13:41:44,588 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:41:44,588 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:41:44,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {6981#true} call #t~ret7 := main(); {6981#true} is VALID [2022-04-27 13:41:44,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6981#true} {6981#true} #92#return; {6981#true} is VALID [2022-04-27 13:41:44,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {6981#true} assume true; {6981#true} is VALID [2022-04-27 13:41:44,588 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:41:44,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {6981#true} call ULTIMATE.init(); {6981#true} is VALID [2022-04-27 13:41:44,589 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:41:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579322388] [2022-04-27 13:41:44,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481003102] [2022-04-27 13:41:44,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481003102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:41:44,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:41:44,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-27 13:41:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378383208] [2022-04-27 13:41:44,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:41:44,591 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:41:44,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:44,592 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:41:44,669 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:41:44,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:41:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:41:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:41:44,671 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:41:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:46,163 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2022-04-27 13:41:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:41:46,163 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:41:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:46,164 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:41:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:41:46,167 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:41:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-27 13:41:46,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-27 13:41:46,290 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:41:46,295 INFO L225 Difference]: With dead ends: 335 [2022-04-27 13:41:46,296 INFO L226 Difference]: Without dead ends: 239 [2022-04-27 13:41:46,296 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:41:46,297 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:41:46,297 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.6s Time] [2022-04-27 13:41:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-27 13:41:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 223. [2022-04-27 13:41:46,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:46,384 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:41:46,384 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:41:46,384 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:41:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:46,391 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:41:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:41:46,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:46,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:46,392 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:41:46,393 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:41:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:46,399 INFO L93 Difference]: Finished difference Result 239 states and 283 transitions. [2022-04-27 13:41:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-04-27 13:41:46,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:46,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:46,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:46,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:46,401 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:41:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2022-04-27 13:41:46,407 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 73 [2022-04-27 13:41:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:46,407 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2022-04-27 13:41:46,407 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:41:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2022-04-27 13:41:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 13:41:46,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:46,408 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:41:46,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:41:46,635 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:41:46,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1894150768, now seen corresponding path program 1 times [2022-04-27 13:41:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:46,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143715559] [2022-04-27 13:41:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:46,645 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:46,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908764582] [2022-04-27 13:41:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:46,647 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:41:46,650 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:41:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:46,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:41:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:46,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:49,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {8676#true} call ULTIMATE.init(); {8676#true} is VALID [2022-04-27 13:41:49,000 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:41:49,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8676#true} {8676#true} #92#return; {8676#true} is VALID [2022-04-27 13:41:49,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {8676#true} call #t~ret7 := main(); {8676#true} is VALID [2022-04-27 13:41:49,001 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:41:49,001 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:41:49,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {8696#(<= 1 main_~p~0)} assume !!(#t~post5 < 10);havoc #t~post5; {8696#(<= 1 main_~p~0)} is VALID [2022-04-27 13:41:49,002 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:41:49,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,002 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:41:49,002 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:41:49,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,003 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:41:49,003 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:41:49,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,004 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:41:49,005 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:41:49,019 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:41:49,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {8751#(<= 1 (div main_~p~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8751#(<= 1 (div main_~p~0 2))} is VALID [2022-04-27 13:41:49,020 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:41:49,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,021 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:41:49,021 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:41:49,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,022 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:41:49,022 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:41:49,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,023 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:41:49,023 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:41:49,024 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:41:49,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:41:49,024 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:41:49,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,025 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:41:49,025 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:41:49,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,026 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:41:49,026 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:41:49,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,027 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:41:49,027 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:41:49,028 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:41:49,028 INFO L290 TraceCheckUtils]: 61: Hoare triple {8806#(<= 1 (div (div main_~p~0 2) 2))} assume !!(#t~post6 < 10);havoc #t~post6; {8806#(<= 1 (div (div main_~p~0 2) 2))} is VALID [2022-04-27 13:41:49,028 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:41:49,028 INFO L290 TraceCheckUtils]: 63: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,028 INFO L290 TraceCheckUtils]: 64: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,029 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:41:49,029 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:41:49,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {8676#true} ~cond := #in~cond; {8676#true} is VALID [2022-04-27 13:41:49,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {8676#true} assume !(0 == ~cond); {8676#true} is VALID [2022-04-27 13:41:49,029 INFO L290 TraceCheckUtils]: 70: Hoare triple {8676#true} assume true; {8676#true} is VALID [2022-04-27 13:41:49,030 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:41:49,030 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:41:49,030 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:41:49,031 INFO L290 TraceCheckUtils]: 74: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:41:49,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {8677#false} assume !(0 == ~cond); {8677#false} is VALID [2022-04-27 13:41:49,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {8677#false} assume true; {8677#false} is VALID [2022-04-27 13:41:49,031 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8677#false} {8677#false} #88#return; {8677#false} is VALID [2022-04-27 13:41:49,031 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:41:49,031 INFO L290 TraceCheckUtils]: 79: Hoare triple {8677#false} ~cond := #in~cond; {8677#false} is VALID [2022-04-27 13:41:49,031 INFO L290 TraceCheckUtils]: 80: Hoare triple {8677#false} assume 0 == ~cond; {8677#false} is VALID [2022-04-27 13:41:49,031 INFO L290 TraceCheckUtils]: 81: Hoare triple {8677#false} assume !false; {8677#false} is VALID [2022-04-27 13:41:49,032 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:41:49,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:41:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:41:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143715559] [2022-04-27 13:41:49,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:41:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908764582] [2022-04-27 13:41:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908764582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:41:49,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:41:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:41:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740934791] [2022-04-27 13:41:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:41:49,033 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:41:49,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:41:49,033 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:41:49,073 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:41:49,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:41:49,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:41:49,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:41:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:41:49,074 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:41:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:49,388 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2022-04-27 13:41:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:41:49,388 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:41:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:41:49,389 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:41:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:41:49,390 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:41:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-04-27 13:41:49,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-04-27 13:41:49,475 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:41:49,480 INFO L225 Difference]: With dead ends: 242 [2022-04-27 13:41:49,480 INFO L226 Difference]: Without dead ends: 222 [2022-04-27 13:41:49,480 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:41:49,481 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:41:49,481 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:41:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-27 13:41:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2022-04-27 13:41:49,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:41:49,594 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:41:49,594 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:41:49,595 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:41:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:49,600 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:41:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:41:49,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:49,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:49,602 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:41:49,602 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:41:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:41:49,608 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2022-04-27 13:41:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-04-27 13:41:49,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:41:49,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:41:49,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:41:49,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:41:49,610 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:41:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2022-04-27 13:41:49,615 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 82 [2022-04-27 13:41:49,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:41:49,615 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2022-04-27 13:41:49,616 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:41:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2022-04-27 13:41:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:41:49,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:41:49,617 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:41:49,644 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:41:49,842 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:41:49,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:41:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:41:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 2 times [2022-04-27 13:41:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:41:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472004804] [2022-04-27 13:41:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:41:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:41:49,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:41:49,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964468356] [2022-04-27 13:41:49,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:41:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:41:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:41:49,877 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:41:49,890 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:41:49,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:41:49,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:41:49,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 13:41:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:41:49,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:41:50,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:41:50,800 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:41:50,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:41:50,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:41:50,801 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:41:50,801 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:41:50,801 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 < 10);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:41:50,801 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:41:50,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,804 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:41:50,804 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:41:50,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,805 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:41:50,805 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:41:50,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,806 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:41:50,807 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:41:50,807 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:41:50,808 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 < 10);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:41:50,808 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:41:50,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,809 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:41:50,809 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:41:50,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,810 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:41:50,810 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:41:50,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,811 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:41:50,812 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:41:50,812 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:41:50,812 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 < 10);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:41:50,812 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:41:50,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,813 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:41:50,813 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:41:50,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,814 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:41:50,814 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:41:50,815 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,815 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:41:50,816 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:41:50,816 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:41:50,817 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 < 10);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:41:50,817 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:41:50,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,818 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:41:50,818 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:41:50,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,819 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:41:50,819 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:41:50,820 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:41:50,820 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:41:50,821 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 < 10);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:41:50,821 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:41:50,821 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,822 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:41:50,822 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:41:50,822 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:41:50,822 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:41:50,822 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:41:50,823 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:41:50,824 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:41:50,825 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:41:50,825 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:41:50,826 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 < 10);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:41:50,826 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:41:50,827 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:41:50,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:41:50,827 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:41:50,828 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:41:50,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:42:06,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {9995#false} assume !false; {9995#false} is VALID [2022-04-27 13:42:06,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {10279#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9995#false} is VALID [2022-04-27 13:42:06,618 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:42:06,618 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:42:06,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 10);havoc #t~post6; {10295#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-27 13:42:06,619 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:42:06,631 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:42:06,645 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:42:06,646 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:42:06,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:06,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:06,646 INFO L290 TraceCheckUtils]: 82: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:06,646 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:42:06,648 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:42:06,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:06,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:06,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:06,648 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:42:06,650 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 < 10);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:42:06,651 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:42:06,686 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:42:07,166 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:42:07,167 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:42:07,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,168 INFO L290 TraceCheckUtils]: 68: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,168 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:42:07,169 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:42:07,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,170 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:42:07,174 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 < 10);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:42:07,177 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:42:07,181 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:42:07,182 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:42:07,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,182 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:42:07,183 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:42:07,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,184 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:42:07,185 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:42:07,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,186 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:42:07,190 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 < 10);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:42:07,195 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:42:07,362 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:42:07,363 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:42:07,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,364 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:42:07,365 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:42:07,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,365 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:42:07,366 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:42:07,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,366 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:42:07,368 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 < 10);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:42:07,370 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:42:07,402 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:42:07,404 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:42:07,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,404 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:42:07,405 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:42:07,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,405 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:42:07,406 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:42:07,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#true} assume !(0 == ~cond); {9994#true} is VALID [2022-04-27 13:42:07,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#true} ~cond := #in~cond; {9994#true} is VALID [2022-04-27 13:42:07,406 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:42:07,407 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 < 10);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:42:07,407 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:42:07,408 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:42:07,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {9994#true} call #t~ret7 := main(); {9994#true} is VALID [2022-04-27 13:42:07,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9994#true} {9994#true} #92#return; {9994#true} is VALID [2022-04-27 13:42:07,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {9994#true} assume true; {9994#true} is VALID [2022-04-27 13:42:07,408 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:42:07,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {9994#true} call ULTIMATE.init(); {9994#true} is VALID [2022-04-27 13:42:07,410 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:42:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:42:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472004804] [2022-04-27 13:42:07,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:42:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964468356] [2022-04-27 13:42:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964468356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:42:07,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:42:07,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:42:07,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427327933] [2022-04-27 13:42:07,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:42:07,412 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:42:07,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:42:07,412 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:42:08,036 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:42:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:42:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:42:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:42:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:42:08,037 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:42:21,994 WARN L232 SmtUtils]: Spent 12.84s 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:42:30,000 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:42:42,138 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:42:44,432 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:42:46,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:42:51,045 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:42:53,224 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:43:07,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:43:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:08,548 INFO L93 Difference]: Finished difference Result 332 states and 434 transitions. [2022-04-27 13:43:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 13:43:08,548 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:43:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:43:08,549 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:43:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:43:08,552 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:43:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 204 transitions. [2022-04-27 13:43:08,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 204 transitions. [2022-04-27 13:43:09,593 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:43:09,599 INFO L225 Difference]: With dead ends: 332 [2022-04-27 13:43:09,600 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 13:43:09,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=114, Invalid=305, Unknown=1, NotChecked=0, Total=420 [2022-04-27 13:43:09,601 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 126 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 187 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:43:09,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 368 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 764 Invalid, 5 Unknown, 0 Unchecked, 19.9s Time] [2022-04-27 13:43:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 13:43:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 257. [2022-04-27 13:43:09,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:43:09,743 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:43:09,743 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:43:09,743 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:43:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:09,751 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:43:09,751 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:43:09,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:09,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:09,753 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:43:09,753 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:43:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:09,761 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2022-04-27 13:43:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2022-04-27 13:43:09,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:09,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:09,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:43:09,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:43:09,763 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:43:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2022-04-27 13:43:09,770 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 94 [2022-04-27 13:43:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:43:09,770 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2022-04-27 13:43:09,770 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:43:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2022-04-27 13:43:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 13:43:09,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:43:09,772 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:43:09,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 13:43:09,997 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:43:09,997 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:43:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:43:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1539828763, now seen corresponding path program 1 times [2022-04-27 13:43:09,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:43:09,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741678166] [2022-04-27 13:43:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:43:10,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:43:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815130197] [2022-04-27 13:43:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:10,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:43:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:43:10,011 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:43:10,015 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:43:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:10,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:43:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:10,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:43:10,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:43:10,482 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:43:10,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {11949#(<= ~counter~0 0)} assume true; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:10,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11949#(<= ~counter~0 0)} {11941#true} #92#return; {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:10,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {11949#(<= ~counter~0 0)} call #t~ret7 := main(); {11949#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:10,483 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:43:10,484 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:43:10,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {11965#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,485 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:43:10,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,486 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:43:10,486 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:43:10,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,487 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:43:10,488 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:43:10,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {11965#(<= ~counter~0 1)} ~cond := #in~cond; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {11965#(<= ~counter~0 1)} assume !(0 == ~cond); {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {11965#(<= ~counter~0 1)} assume true; {11965#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:10,489 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:43:10,489 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:43:10,490 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:43:10,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {12020#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,490 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:43:10,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,492 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:43:10,492 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:43:10,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,495 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:43:10,495 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:43:10,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {12020#(<= ~counter~0 2)} ~cond := #in~cond; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {12020#(<= ~counter~0 2)} assume !(0 == ~cond); {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {12020#(<= ~counter~0 2)} assume true; {12020#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:10,496 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:43:10,497 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:43:10,497 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:43:10,497 INFO L290 TraceCheckUtils]: 43: Hoare triple {12075#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,498 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:43:10,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,499 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:43:10,499 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:43:10,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,501 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:43:10,501 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:43:10,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {12075#(<= ~counter~0 3)} ~cond := #in~cond; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {12075#(<= ~counter~0 3)} assume !(0 == ~cond); {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {12075#(<= ~counter~0 3)} assume true; {12075#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:10,503 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:43:10,503 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:43:10,504 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:43:10,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {12130#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,504 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:43:10,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,505 INFO L290 TraceCheckUtils]: 64: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,505 INFO L290 TraceCheckUtils]: 65: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,505 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:43:10,506 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:43:10,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,507 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:43:10,507 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:43:10,508 INFO L290 TraceCheckUtils]: 73: Hoare triple {12130#(<= ~counter~0 4)} ~cond := #in~cond; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,508 INFO L290 TraceCheckUtils]: 74: Hoare triple {12130#(<= ~counter~0 4)} assume !(0 == ~cond); {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {12130#(<= ~counter~0 4)} assume true; {12130#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:10,509 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:43:10,509 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:43:10,509 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:43:10,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {12185#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:43:10,510 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:43:10,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 10);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:43:10,510 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:43:10,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L290 TraceCheckUtils]: 85: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11942#false} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:43:10,510 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:43:10,510 INFO L290 TraceCheckUtils]: 88: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {11942#false} assume !(0 == ~cond); {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L290 TraceCheckUtils]: 90: Hoare triple {11942#false} assume true; {11942#false} is VALID [2022-04-27 13:43:10,510 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11942#false} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:43:10,510 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:43:10,511 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:43:10,511 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:43:10,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 10);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:43:10,511 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:43:10,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:43:10,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:43:10,511 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:43:10,511 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:43:10,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:43:10,879 INFO L290 TraceCheckUtils]: 99: Hoare triple {11942#false} assume !false; {11942#false} is VALID [2022-04-27 13:43:10,879 INFO L290 TraceCheckUtils]: 98: Hoare triple {11942#false} assume 0 == ~cond; {11942#false} is VALID [2022-04-27 13:43:10,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {11942#false} ~cond := #in~cond; {11942#false} is VALID [2022-04-27 13:43:10,879 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:43:10,879 INFO L290 TraceCheckUtils]: 95: Hoare triple {11942#false} assume !(#t~post6 < 10);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:43:10,879 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:43:10,879 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:43:10,879 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:43:10,880 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11941#true} {11942#false} #86#return; {11942#false} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 89: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 88: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,880 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:43:10,880 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11941#true} {11942#false} #84#return; {11942#false} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,880 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:43:10,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {11942#false} assume !!(#t~post6 < 10);havoc #t~post6; {11942#false} is VALID [2022-04-27 13:43:10,880 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:43:10,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {12309#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {11942#false} is VALID [2022-04-27 13:43:10,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {12313#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12309#(< |main_#t~post5| 10)} is VALID [2022-04-27 13:43:10,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {12313#(< ~counter~0 10)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,882 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11941#true} {12313#(< ~counter~0 10)} #82#return; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 74: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 73: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L272 TraceCheckUtils]: 72: Hoare triple {12313#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11941#true} {12313#(< ~counter~0 10)} #80#return; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,883 INFO L272 TraceCheckUtils]: 67: Hoare triple {12313#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,883 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11941#true} {12313#(< ~counter~0 10)} #78#return; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,883 INFO L272 TraceCheckUtils]: 62: Hoare triple {12313#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {12313#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {12368#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12313#(< ~counter~0 10)} is VALID [2022-04-27 13:43:10,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {12368#(< ~counter~0 9)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,907 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11941#true} {12368#(< ~counter~0 9)} #82#return; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,907 INFO L272 TraceCheckUtils]: 54: Hoare triple {12368#(< ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,908 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11941#true} {12368#(< ~counter~0 9)} #80#return; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,908 INFO L272 TraceCheckUtils]: 49: Hoare triple {12368#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,909 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11941#true} {12368#(< ~counter~0 9)} #78#return; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,910 INFO L272 TraceCheckUtils]: 44: Hoare triple {12368#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {12368#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {12423#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12368#(< ~counter~0 9)} is VALID [2022-04-27 13:43:10,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {12423#(< ~counter~0 8)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,912 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11941#true} {12423#(< ~counter~0 8)} #82#return; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,913 INFO L272 TraceCheckUtils]: 36: Hoare triple {12423#(< ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,914 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {11941#true} {12423#(< ~counter~0 8)} #80#return; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,914 INFO L272 TraceCheckUtils]: 31: Hoare triple {12423#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,915 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11941#true} {12423#(< ~counter~0 8)} #78#return; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,915 INFO L272 TraceCheckUtils]: 26: Hoare triple {12423#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {12423#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {12478#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12423#(< ~counter~0 8)} is VALID [2022-04-27 13:43:10,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {12478#(< ~counter~0 7)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,917 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11941#true} {12478#(< ~counter~0 7)} #82#return; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,918 INFO L272 TraceCheckUtils]: 18: Hoare triple {12478#(< ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,918 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11941#true} {12478#(< ~counter~0 7)} #80#return; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {12478#(< ~counter~0 7)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,919 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11941#true} {12478#(< ~counter~0 7)} #78#return; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {11941#true} assume true; {11941#true} is VALID [2022-04-27 13:43:10,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {11941#true} assume !(0 == ~cond); {11941#true} is VALID [2022-04-27 13:43:10,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {11941#true} ~cond := #in~cond; {11941#true} is VALID [2022-04-27 13:43:10,919 INFO L272 TraceCheckUtils]: 8: Hoare triple {12478#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11941#true} is VALID [2022-04-27 13:43:10,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {12478#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {12533#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12478#(< ~counter~0 7)} is VALID [2022-04-27 13:43:10,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {12533#(< ~counter~0 6)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~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 6)} is VALID [2022-04-27 13:43:10,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {12533#(< ~counter~0 6)} call #t~ret7 := main(); {12533#(< ~counter~0 6)} is VALID [2022-04-27 13:43:10,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12533#(< ~counter~0 6)} {11941#true} #92#return; {12533#(< ~counter~0 6)} is VALID [2022-04-27 13:43:10,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {12533#(< ~counter~0 6)} assume true; {12533#(< ~counter~0 6)} is VALID [2022-04-27 13:43:10,921 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 6)} is VALID [2022-04-27 13:43:10,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {11941#true} call ULTIMATE.init(); {11941#true} is VALID [2022-04-27 13:43:10,922 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:43:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:43:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741678166] [2022-04-27 13:43:10,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:43:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815130197] [2022-04-27 13:43:10,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815130197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:43:10,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:43:10,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:43:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434351713] [2022-04-27 13:43:10,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:43:10,923 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:43:10,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:43:10,924 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:43:11,015 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:43:11,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:43:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:43:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:43:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:43:11,016 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:43:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:12,357 INFO L93 Difference]: Finished difference Result 746 states and 1016 transitions. [2022-04-27 13:43:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 13:43:12,357 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:43:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:43:12,358 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:43:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:43:12,362 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:43:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2022-04-27 13:43:12,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 260 transitions. [2022-04-27 13:43:12,598 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:43:12,626 INFO L225 Difference]: With dead ends: 746 [2022-04-27 13:43:12,626 INFO L226 Difference]: Without dead ends: 659 [2022-04-27 13:43:12,629 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:43:12,631 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:43:12,631 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:43:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-04-27 13:43:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 552. [2022-04-27 13:43:13,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:43:13,033 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:43:13,034 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:43:13,035 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:43:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:13,062 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:43:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:43:13,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:13,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:13,065 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:43:13,066 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:43:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:13,097 INFO L93 Difference]: Finished difference Result 659 states and 886 transitions. [2022-04-27 13:43:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2022-04-27 13:43:13,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:13,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:13,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:43:13,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:43:13,101 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:43:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 730 transitions. [2022-04-27 13:43:13,123 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 730 transitions. Word has length 100 [2022-04-27 13:43:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:43:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 730 transitions. [2022-04-27 13:43:13,138 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:43:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 730 transitions. [2022-04-27 13:43:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-27 13:43:13,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:43:13,139 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:43:13,166 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:43:13,340 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:43:13,340 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:43:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:43:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 1 times [2022-04-27 13:43:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:43:13,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724677654] [2022-04-27 13:43:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:43:13,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:43:13,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312767662] [2022-04-27 13:43:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:43:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:43:13,364 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:43:13,365 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:43:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:13,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:43:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:13,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:43:13,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:43:13,859 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:43:13,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {15659#(<= ~counter~0 0)} assume true; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:13,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15659#(<= ~counter~0 0)} {15651#true} #92#return; {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:13,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {15659#(<= ~counter~0 0)} call #t~ret7 := main(); {15659#(<= ~counter~0 0)} is VALID [2022-04-27 13:43:13,860 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:43:13,861 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:43:13,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {15675#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,862 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:43:13,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,863 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:43:13,863 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:43:13,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,864 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:43:13,865 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:43:13,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {15675#(<= ~counter~0 1)} ~cond := #in~cond; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {15675#(<= ~counter~0 1)} assume !(0 == ~cond); {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {15675#(<= ~counter~0 1)} assume true; {15675#(<= ~counter~0 1)} is VALID [2022-04-27 13:43:13,866 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:43:13,866 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:43:13,867 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:43:13,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {15730#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,868 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:43:13,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,869 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:43:13,869 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:43:13,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,870 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:43:13,871 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:43:13,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {15730#(<= ~counter~0 2)} ~cond := #in~cond; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {15730#(<= ~counter~0 2)} assume !(0 == ~cond); {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {15730#(<= ~counter~0 2)} assume true; {15730#(<= ~counter~0 2)} is VALID [2022-04-27 13:43:13,872 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:43:13,872 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:43:13,873 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:43:13,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {15785#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,874 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:43:13,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,875 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:43:13,875 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:43:13,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,876 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:43:13,877 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:43:13,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {15785#(<= ~counter~0 3)} ~cond := #in~cond; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {15785#(<= ~counter~0 3)} assume !(0 == ~cond); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:13,878 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:43:13,878 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:43:13,879 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:43:13,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {15840#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,880 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:43:13,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,881 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:43:13,881 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:43:13,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {15840#(<= ~counter~0 4)} ~cond := #in~cond; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {15840#(<= ~counter~0 4)} assume !(0 == ~cond); {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {15840#(<= ~counter~0 4)} assume true; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:13,883 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:43:13,883 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:43:13,883 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:43:13,884 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:43:13,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {15883#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,884 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:43:13,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,885 INFO L290 TraceCheckUtils]: 78: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,885 INFO L290 TraceCheckUtils]: 79: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,886 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:43:13,886 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:43:13,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {15883#(<= ~counter~0 5)} ~cond := #in~cond; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {15883#(<= ~counter~0 5)} assume !(0 == ~cond); {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {15883#(<= ~counter~0 5)} assume true; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:13,887 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:43:13,888 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:43:13,888 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:43:13,891 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:43:13,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {15926#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,891 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:43:13,892 INFO L290 TraceCheckUtils]: 91: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,892 INFO L290 TraceCheckUtils]: 92: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,893 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:43:13,893 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:43:13,893 INFO L290 TraceCheckUtils]: 96: Hoare triple {15926#(<= ~counter~0 6)} ~cond := #in~cond; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,894 INFO L290 TraceCheckUtils]: 97: Hoare triple {15926#(<= ~counter~0 6)} assume !(0 == ~cond); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,894 INFO L290 TraceCheckUtils]: 98: Hoare triple {15926#(<= ~counter~0 6)} assume true; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:13,894 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:43:13,895 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:43:13,895 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:43:13,895 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:43:13,896 INFO L290 TraceCheckUtils]: 103: Hoare triple {15969#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:43:13,896 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:43:13,896 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:43:13,896 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:43:13,896 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:43:13,896 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:43:13,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:43:14,330 INFO L290 TraceCheckUtils]: 107: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2022-04-27 13:43:14,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {15652#false} assume 0 == ~cond; {15652#false} is VALID [2022-04-27 13:43:14,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {15652#false} ~cond := #in~cond; {15652#false} is VALID [2022-04-27 13:43:14,330 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:43:14,331 INFO L290 TraceCheckUtils]: 103: Hoare triple {15997#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {15652#false} is VALID [2022-04-27 13:43:14,331 INFO L290 TraceCheckUtils]: 102: Hoare triple {16001#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15997#(< |main_#t~post6| 10)} is VALID [2022-04-27 13:43:14,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {16001#(< ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,332 INFO L290 TraceCheckUtils]: 100: Hoare triple {16001#(< ~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); {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,332 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {15651#true} {16001#(< ~counter~0 10)} #86#return; {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,332 INFO L272 TraceCheckUtils]: 95: Hoare triple {16001#(< ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,333 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {15651#true} {16001#(< ~counter~0 10)} #84#return; {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,333 INFO L272 TraceCheckUtils]: 90: Hoare triple {16001#(< ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,334 INFO L290 TraceCheckUtils]: 89: Hoare triple {16001#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,334 INFO L290 TraceCheckUtils]: 88: Hoare triple {16044#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16001#(< ~counter~0 10)} is VALID [2022-04-27 13:43:14,335 INFO L290 TraceCheckUtils]: 87: Hoare triple {16044#(< ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {16044#(< ~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); {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,335 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15651#true} {16044#(< ~counter~0 9)} #86#return; {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,335 INFO L290 TraceCheckUtils]: 84: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L272 TraceCheckUtils]: 81: Hoare triple {16044#(< ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15651#true} {16044#(< ~counter~0 9)} #84#return; {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,336 INFO L272 TraceCheckUtils]: 76: Hoare triple {16044#(< ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {16044#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {16087#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16044#(< ~counter~0 9)} is VALID [2022-04-27 13:43:14,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {16087#(< ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {16087#(< ~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); {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,338 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15651#true} {16087#(< ~counter~0 8)} #86#return; {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,338 INFO L272 TraceCheckUtils]: 67: Hoare triple {16087#(< ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,339 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15651#true} {16087#(< ~counter~0 8)} #84#return; {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,339 INFO L272 TraceCheckUtils]: 62: Hoare triple {16087#(< ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {16087#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {15926#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16087#(< ~counter~0 8)} is VALID [2022-04-27 13:43:14,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {15926#(<= ~counter~0 6)} assume !(~r~0 >= ~d~0); {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,341 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15651#true} {15926#(<= ~counter~0 6)} #82#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L272 TraceCheckUtils]: 54: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15651#true} {15926#(<= ~counter~0 6)} #80#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,341 INFO L272 TraceCheckUtils]: 49: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,342 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15651#true} {15926#(<= ~counter~0 6)} #78#return; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,342 INFO L272 TraceCheckUtils]: 44: Hoare triple {15926#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {15926#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,343 INFO L290 TraceCheckUtils]: 42: Hoare triple {15883#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15926#(<= ~counter~0 6)} is VALID [2022-04-27 13:43:14,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {15883#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,344 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15651#true} {15883#(<= ~counter~0 5)} #82#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,344 INFO L272 TraceCheckUtils]: 36: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,345 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15651#true} {15883#(<= ~counter~0 5)} #80#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,345 INFO L272 TraceCheckUtils]: 31: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,345 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15651#true} {15883#(<= ~counter~0 5)} #78#return; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,346 INFO L272 TraceCheckUtils]: 26: Hoare triple {15883#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {15883#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {15840#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15883#(<= ~counter~0 5)} is VALID [2022-04-27 13:43:14,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {15840#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,347 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15651#true} {15840#(<= ~counter~0 4)} #82#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,347 INFO L272 TraceCheckUtils]: 18: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,348 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15651#true} {15840#(<= ~counter~0 4)} #80#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,348 INFO L272 TraceCheckUtils]: 13: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,348 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15651#true} {15840#(<= ~counter~0 4)} #78#return; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {15651#true} assume true; {15651#true} is VALID [2022-04-27 13:43:14,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {15651#true} assume !(0 == ~cond); {15651#true} is VALID [2022-04-27 13:43:14,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#true} ~cond := #in~cond; {15651#true} is VALID [2022-04-27 13:43:14,349 INFO L272 TraceCheckUtils]: 8: Hoare triple {15840#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15651#true} is VALID [2022-04-27 13:43:14,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {15840#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {15785#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15840#(<= ~counter~0 4)} is VALID [2022-04-27 13:43:14,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {15785#(<= ~counter~0 3)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:14,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {15785#(<= ~counter~0 3)} call #t~ret7 := main(); {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:14,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15785#(<= ~counter~0 3)} {15651#true} #92#return; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:14,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {15785#(<= ~counter~0 3)} assume true; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:14,351 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; {15785#(<= ~counter~0 3)} is VALID [2022-04-27 13:43:14,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2022-04-27 13:43:14,352 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:43:14,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:43:14,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724677654] [2022-04-27 13:43:14,352 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:43:14,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312767662] [2022-04-27 13:43:14,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312767662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:43:14,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:43:14,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-27 13:43:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858923685] [2022-04-27 13:43:14,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:43:14,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) Word has length 108 [2022-04-27 13:43:14,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:43:14,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2022-04-27 13:43:14,474 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:43:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:43:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:43:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:43:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:43:14,475 INFO L87 Difference]: Start difference. First operand 552 states and 730 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2022-04-27 13:43:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:15,787 INFO L93 Difference]: Finished difference Result 704 states and 943 transitions. [2022-04-27 13:43:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:43:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) Word has length 108 [2022-04-27 13:43:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:43:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2022-04-27 13:43:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 244 transitions. [2022-04-27 13:43:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2022-04-27 13:43:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 244 transitions. [2022-04-27 13:43:15,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 244 transitions. [2022-04-27 13:43:16,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:43:16,044 INFO L225 Difference]: With dead ends: 704 [2022-04-27 13:43:16,045 INFO L226 Difference]: Without dead ends: 667 [2022-04-27 13:43:16,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:43:16,046 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 129 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:43:16,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 395 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:43:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-27 13:43:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2022-04-27 13:43:16,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:43:16,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:16,493 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:16,493 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:16,519 INFO L93 Difference]: Finished difference Result 667 states and 856 transitions. [2022-04-27 13:43:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 856 transitions. [2022-04-27 13:43:16,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:16,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:16,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) Second operand 667 states. [2022-04-27 13:43:16,523 INFO L87 Difference]: Start difference. First operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) Second operand 667 states. [2022-04-27 13:43:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:16,548 INFO L93 Difference]: Finished difference Result 667 states and 856 transitions. [2022-04-27 13:43:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 856 transitions. [2022-04-27 13:43:16,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:16,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:16,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:43:16,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:43:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 439 states have (on average 1.2277904328018223) internal successors, (539), 452 states have internal predecessors, (539), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 844 transitions. [2022-04-27 13:43:16,580 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 844 transitions. Word has length 108 [2022-04-27 13:43:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:43:16,580 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 844 transitions. [2022-04-27 13:43:16,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 12 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2022-04-27 13:43:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 844 transitions. [2022-04-27 13:43:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 13:43:16,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:43:16,582 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:43:16,609 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:43:16,806 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:43:16,807 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:43:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:43:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1873291208, now seen corresponding path program 1 times [2022-04-27 13:43:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:43:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141255768] [2022-04-27 13:43:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:43:16,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:43:16,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431252584] [2022-04-27 13:43:16,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:16,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:43:16,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:43:16,830 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:43:16,832 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:43:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:16,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 13:43:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:16,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:43:17,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {19480#true} call ULTIMATE.init(); {19480#true} is VALID [2022-04-27 13:43:17,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {19480#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; {19480#true} is VALID [2022-04-27 13:43:17,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19480#true} {19480#true} #92#return; {19480#true} is VALID [2022-04-27 13:43:17,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {19480#true} call #t~ret7 := main(); {19480#true} is VALID [2022-04-27 13:43:17,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {19480#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; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post5 < 10);havoc #t~post5; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,500 INFO L272 TraceCheckUtils]: 8: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,501 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #78#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,501 INFO L272 TraceCheckUtils]: 13: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,501 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #80#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,502 INFO L272 TraceCheckUtils]: 18: Hoare triple {19500#(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)); {19480#true} is VALID [2022-04-27 13:43:17,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,502 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #82#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {19500#(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; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post5 < 10);havoc #t~post5; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,503 INFO L272 TraceCheckUtils]: 26: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {19480#true} {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #78#return; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,504 INFO L272 TraceCheckUtils]: 31: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,505 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19480#true} {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #80#return; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,505 INFO L272 TraceCheckUtils]: 36: Hoare triple {19555#(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)); {19480#true} is VALID [2022-04-27 13:43:17,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,505 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19480#true} {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #82#return; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {19555#(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; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post5 < 10);havoc #t~post5; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,507 INFO L272 TraceCheckUtils]: 44: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,507 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {19480#true} {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #78#return; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,507 INFO L272 TraceCheckUtils]: 49: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 50: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19480#true} {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #80#return; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,508 INFO L272 TraceCheckUtils]: 54: Hoare triple {19610#(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)); {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,508 INFO L290 TraceCheckUtils]: 57: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,509 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {19480#true} {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #82#return; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !(~r~0 >= ~d~0); {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} assume !!(#t~post6 < 10);havoc #t~post6; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,510 INFO L272 TraceCheckUtils]: 62: Hoare triple {19610#(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)); {19480#true} is VALID [2022-04-27 13:43:17,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19480#true} {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #84#return; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,511 INFO L272 TraceCheckUtils]: 67: Hoare triple {19610#(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)); {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L290 TraceCheckUtils]: 68: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L290 TraceCheckUtils]: 69: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,511 INFO L290 TraceCheckUtils]: 70: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,512 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19480#true} {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} #86#return; {19610#(and (<= 1 main_~B~0) (= main_~d~0 (* main_~B~0 4)))} is VALID [2022-04-27 13:43:17,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {19610#(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); {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {19555#(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; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} assume !!(#t~post6 < 10);havoc #t~post6; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,514 INFO L272 TraceCheckUtils]: 76: Hoare triple {19555#(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)); {19480#true} is VALID [2022-04-27 13:43:17,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,514 INFO L290 TraceCheckUtils]: 78: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,514 INFO L290 TraceCheckUtils]: 79: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,515 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19480#true} {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #84#return; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,515 INFO L272 TraceCheckUtils]: 81: Hoare triple {19555#(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)); {19480#true} is VALID [2022-04-27 13:43:17,515 INFO L290 TraceCheckUtils]: 82: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,515 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19480#true} {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} #86#return; {19555#(and (<= 1 main_~B~0) (= (* main_~B~0 2) main_~d~0))} is VALID [2022-04-27 13:43:17,516 INFO L290 TraceCheckUtils]: 86: Hoare triple {19555#(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); {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,516 INFO L290 TraceCheckUtils]: 87: Hoare triple {19500#(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; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 10);havoc #t~post6; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,517 INFO L272 TraceCheckUtils]: 90: Hoare triple {19500#(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)); {19480#true} is VALID [2022-04-27 13:43:17,517 INFO L290 TraceCheckUtils]: 91: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,517 INFO L290 TraceCheckUtils]: 93: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,518 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #84#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,518 INFO L272 TraceCheckUtils]: 95: Hoare triple {19500#(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)); {19480#true} is VALID [2022-04-27 13:43:17,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,518 INFO L290 TraceCheckUtils]: 98: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,518 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #86#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,519 INFO L272 TraceCheckUtils]: 101: Hoare triple {19500#(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)); {19480#true} is VALID [2022-04-27 13:43:17,519 INFO L290 TraceCheckUtils]: 102: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:17,519 INFO L290 TraceCheckUtils]: 103: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:17,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:17,519 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {19480#true} {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} #88#return; {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:43:17,520 INFO L272 TraceCheckUtils]: 106: Hoare triple {19500#(and (<= 1 main_~B~0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {19806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:43:17,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {19806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:43:17,521 INFO L290 TraceCheckUtils]: 108: Hoare triple {19810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19481#false} is VALID [2022-04-27 13:43:17,521 INFO L290 TraceCheckUtils]: 109: Hoare triple {19481#false} assume !false; {19481#false} is VALID [2022-04-27 13:43:17,521 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:43:17,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:43:18,689 INFO L290 TraceCheckUtils]: 109: Hoare triple {19481#false} assume !false; {19481#false} is VALID [2022-04-27 13:43:18,690 INFO L290 TraceCheckUtils]: 108: Hoare triple {19810#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19481#false} is VALID [2022-04-27 13:43:18,690 INFO L290 TraceCheckUtils]: 107: Hoare triple {19806#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:43:18,691 INFO L272 TraceCheckUtils]: 106: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {19806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:43:18,691 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #88#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,691 INFO L290 TraceCheckUtils]: 104: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,691 INFO L290 TraceCheckUtils]: 103: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,691 INFO L272 TraceCheckUtils]: 101: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,692 INFO L290 TraceCheckUtils]: 100: Hoare triple {19826#(= main_~B~0 main_~d~0)} assume !(1 != ~p~0); {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,692 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #86#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,692 INFO L290 TraceCheckUtils]: 98: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,692 INFO L290 TraceCheckUtils]: 97: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,692 INFO L290 TraceCheckUtils]: 96: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,692 INFO L272 TraceCheckUtils]: 95: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,693 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #84#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,693 INFO L290 TraceCheckUtils]: 93: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,693 INFO L290 TraceCheckUtils]: 92: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,693 INFO L290 TraceCheckUtils]: 91: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,693 INFO L272 TraceCheckUtils]: 90: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,693 INFO L290 TraceCheckUtils]: 89: Hoare triple {19826#(= main_~B~0 main_~d~0)} assume !!(#t~post6 < 10);havoc #t~post6; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {19826#(= main_~B~0 main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,694 INFO L290 TraceCheckUtils]: 87: Hoare triple {19826#(= main_~B~0 main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,696 INFO L290 TraceCheckUtils]: 86: Hoare triple {19887#(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); {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,696 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19480#true} {19887#(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; {19887#(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:43:18,696 INFO L290 TraceCheckUtils]: 84: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,696 INFO L290 TraceCheckUtils]: 83: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,696 INFO L290 TraceCheckUtils]: 82: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,696 INFO L272 TraceCheckUtils]: 81: Hoare triple {19887#(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)); {19480#true} is VALID [2022-04-27 13:43:18,697 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19480#true} {19887#(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; {19887#(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:43:18,697 INFO L290 TraceCheckUtils]: 79: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,697 INFO L272 TraceCheckUtils]: 76: Hoare triple {19887#(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)); {19480#true} is VALID [2022-04-27 13:43:18,698 INFO L290 TraceCheckUtils]: 75: Hoare triple {19887#(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 < 10);havoc #t~post6; {19887#(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:43:18,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {19887#(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; {19887#(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:43:18,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {19887#(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; {19887#(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:43:18,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {19930#(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); {19887#(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:43:18,702 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19480#true} {19930#(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; {19930#(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:43:18,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,702 INFO L290 TraceCheckUtils]: 69: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,702 INFO L290 TraceCheckUtils]: 68: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,702 INFO L272 TraceCheckUtils]: 67: Hoare triple {19930#(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)); {19480#true} is VALID [2022-04-27 13:43:18,703 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {19480#true} {19930#(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; {19930#(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:43:18,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,703 INFO L272 TraceCheckUtils]: 62: Hoare triple {19930#(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)); {19480#true} is VALID [2022-04-27 13:43:18,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {19930#(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 < 10);havoc #t~post6; {19930#(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:43:18,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {19930#(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; {19930#(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:43:18,706 INFO L290 TraceCheckUtils]: 59: Hoare triple {19930#(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); {19930#(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:43:18,706 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {19480#true} {19930#(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; {19930#(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:43:18,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,706 INFO L272 TraceCheckUtils]: 54: Hoare triple {19930#(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)); {19480#true} is VALID [2022-04-27 13:43:18,707 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19480#true} {19930#(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; {19930#(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:43:18,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,707 INFO L272 TraceCheckUtils]: 49: Hoare triple {19930#(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)); {19480#true} is VALID [2022-04-27 13:43:18,708 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {19480#true} {19930#(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; {19930#(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:43:18,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,708 INFO L272 TraceCheckUtils]: 44: Hoare triple {19930#(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)); {19480#true} is VALID [2022-04-27 13:43:18,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {19930#(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 < 10);havoc #t~post5; {19930#(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:43:18,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {19930#(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; {19930#(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:43:18,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {19887#(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; {19930#(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:43:18,712 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19480#true} {19887#(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; {19887#(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:43:18,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,712 INFO L272 TraceCheckUtils]: 36: Hoare triple {19887#(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)); {19480#true} is VALID [2022-04-27 13:43:18,713 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19480#true} {19887#(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; {19887#(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:43:18,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,713 INFO L272 TraceCheckUtils]: 31: Hoare triple {19887#(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)); {19480#true} is VALID [2022-04-27 13:43:18,716 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {19480#true} {19887#(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; {19887#(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:43:18,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,716 INFO L272 TraceCheckUtils]: 26: Hoare triple {19887#(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)); {19480#true} is VALID [2022-04-27 13:43:18,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {19887#(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 < 10);havoc #t~post5; {19887#(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:43:18,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {19887#(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; {19887#(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:43:18,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {19826#(= main_~B~0 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19887#(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:43:18,719 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #82#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,719 INFO L272 TraceCheckUtils]: 18: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,719 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #80#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L272 TraceCheckUtils]: 13: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19480#true} {19826#(= main_~B~0 main_~d~0)} #78#return; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {19480#true} assume !(0 == ~cond); {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {19480#true} ~cond := #in~cond; {19480#true} is VALID [2022-04-27 13:43:18,720 INFO L272 TraceCheckUtils]: 8: Hoare triple {19826#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {19480#true} is VALID [2022-04-27 13:43:18,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {19826#(= main_~B~0 main_~d~0)} assume !!(#t~post5 < 10);havoc #t~post5; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {19826#(= main_~B~0 main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {19480#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; {19826#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:43:18,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {19480#true} call #t~ret7 := main(); {19480#true} is VALID [2022-04-27 13:43:18,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19480#true} {19480#true} #92#return; {19480#true} is VALID [2022-04-27 13:43:18,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {19480#true} assume true; {19480#true} is VALID [2022-04-27 13:43:18,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {19480#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; {19480#true} is VALID [2022-04-27 13:43:18,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {19480#true} call ULTIMATE.init(); {19480#true} is VALID [2022-04-27 13:43:18,722 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:43:18,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:43:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141255768] [2022-04-27 13:43:18,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:43:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431252584] [2022-04-27 13:43:18,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431252584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:43:18,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:43:18,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:43:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908434355] [2022-04-27 13:43:18,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:43:18,723 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:43:18,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:43:18,724 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:43:18,856 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:43:18,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:43:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:43:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:43:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:43:18,857 INFO L87 Difference]: Start difference. First operand 651 states and 844 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:43:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:20,721 INFO L93 Difference]: Finished difference Result 657 states and 850 transitions. [2022-04-27 13:43:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:43:20,721 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:43:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:43:20,722 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:43:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:43:20,723 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:43:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-27 13:43:20,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-27 13:43:20,817 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:43:20,844 INFO L225 Difference]: With dead ends: 657 [2022-04-27 13:43:20,844 INFO L226 Difference]: Without dead ends: 651 [2022-04-27 13:43:20,845 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:43:20,846 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:43:20,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:43:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-04-27 13:43:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2022-04-27 13:43:21,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:43:21,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 651 states. Second operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:21,293 INFO L74 IsIncluded]: Start isIncluded. First operand 651 states. Second operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:21,293 INFO L87 Difference]: Start difference. First operand 651 states. Second operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:21,320 INFO L93 Difference]: Finished difference Result 651 states and 842 transitions. [2022-04-27 13:43:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 842 transitions. [2022-04-27 13:43:21,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:21,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:21,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) Second operand 651 states. [2022-04-27 13:43:21,325 INFO L87 Difference]: Start difference. First operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) Second operand 651 states. [2022-04-27 13:43:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:21,372 INFO L93 Difference]: Finished difference Result 651 states and 842 transitions. [2022-04-27 13:43:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 842 transitions. [2022-04-27 13:43:21,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:21,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:21,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:43:21,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:43:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 439 states have (on average 1.2232346241457859) internal successors, (537), 452 states have internal predecessors, (537), 155 states have call successors, (155), 58 states have call predecessors, (155), 56 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2022-04-27 13:43:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 842 transitions. [2022-04-27 13:43:21,403 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 842 transitions. Word has length 110 [2022-04-27 13:43:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:43:21,403 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 842 transitions. [2022-04-27 13:43:21,404 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:43:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 842 transitions. [2022-04-27 13:43:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 13:43:21,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:43:21,407 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:43:21,434 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:43:21,624 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:43:21,625 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:43:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:43:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1491499276, now seen corresponding path program 2 times [2022-04-27 13:43:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:43:21,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625064248] [2022-04-27 13:43:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:43:21,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:43:21,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496029141] [2022-04-27 13:43:21,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:43:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:43:21,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:43:21,643 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:43:21,646 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:43:21,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:43:21,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:43:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:43:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:21,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:43:21,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {23212#true} call ULTIMATE.init(); {23212#true} is VALID [2022-04-27 13:43:21,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {23212#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; {23212#true} is VALID [2022-04-27 13:43:21,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23212#true} {23212#true} #92#return; {23212#true} is VALID [2022-04-27 13:43:21,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {23212#true} call #t~ret7 := main(); {23212#true} is VALID [2022-04-27 13:43:21,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {23212#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; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {23232#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {23232#(= main_~p~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,966 INFO L272 TraceCheckUtils]: 8: Hoare triple {23232#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23212#true} {23232#(= main_~p~0 1)} #78#return; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,966 INFO L272 TraceCheckUtils]: 13: Hoare triple {23232#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,967 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23212#true} {23232#(= main_~p~0 1)} #80#return; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,967 INFO L272 TraceCheckUtils]: 18: Hoare triple {23232#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,968 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23212#true} {23232#(= main_~p~0 1)} #82#return; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {23232#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {23287#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {23287#(= main_~p~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,969 INFO L272 TraceCheckUtils]: 26: Hoare triple {23287#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {23212#true} {23287#(= main_~p~0 2)} #78#return; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,969 INFO L272 TraceCheckUtils]: 31: Hoare triple {23287#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,970 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23212#true} {23287#(= main_~p~0 2)} #80#return; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,970 INFO L272 TraceCheckUtils]: 36: Hoare triple {23287#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,970 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23212#true} {23287#(= main_~p~0 2)} #82#return; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {23287#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {23342#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {23342#(= main_~p~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,971 INFO L272 TraceCheckUtils]: 44: Hoare triple {23342#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {23212#true} {23342#(= main_~p~0 4)} #78#return; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,972 INFO L272 TraceCheckUtils]: 49: Hoare triple {23342#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,973 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {23212#true} {23342#(= main_~p~0 4)} #80#return; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,973 INFO L272 TraceCheckUtils]: 54: Hoare triple {23342#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,973 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23212#true} {23342#(= main_~p~0 4)} #82#return; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {23342#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {23342#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {23342#(= main_~p~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,974 INFO L272 TraceCheckUtils]: 62: Hoare triple {23342#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 64: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,974 INFO L290 TraceCheckUtils]: 65: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,975 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23212#true} {23342#(= main_~p~0 4)} #84#return; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,975 INFO L272 TraceCheckUtils]: 67: Hoare triple {23342#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,975 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23212#true} {23342#(= main_~p~0 4)} #86#return; {23342#(= main_~p~0 4)} is VALID [2022-04-27 13:43:21,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {23342#(= 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); {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {23287#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {23287#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,977 INFO L290 TraceCheckUtils]: 75: Hoare triple {23287#(= main_~p~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,977 INFO L272 TraceCheckUtils]: 76: Hoare triple {23287#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,977 INFO L290 TraceCheckUtils]: 77: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,977 INFO L290 TraceCheckUtils]: 78: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,977 INFO L290 TraceCheckUtils]: 79: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,978 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23212#true} {23287#(= main_~p~0 2)} #84#return; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,978 INFO L272 TraceCheckUtils]: 81: Hoare triple {23287#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,978 INFO L290 TraceCheckUtils]: 82: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,978 INFO L290 TraceCheckUtils]: 83: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,978 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23212#true} {23287#(= main_~p~0 2)} #86#return; {23287#(= main_~p~0 2)} is VALID [2022-04-27 13:43:21,979 INFO L290 TraceCheckUtils]: 86: Hoare triple {23287#(= 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); {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,979 INFO L290 TraceCheckUtils]: 87: Hoare triple {23232#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,979 INFO L290 TraceCheckUtils]: 88: Hoare triple {23232#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,980 INFO L290 TraceCheckUtils]: 89: Hoare triple {23232#(= main_~p~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,980 INFO L272 TraceCheckUtils]: 90: Hoare triple {23232#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,980 INFO L290 TraceCheckUtils]: 91: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,980 INFO L290 TraceCheckUtils]: 92: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,980 INFO L290 TraceCheckUtils]: 93: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,980 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23212#true} {23232#(= main_~p~0 1)} #84#return; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,980 INFO L272 TraceCheckUtils]: 95: Hoare triple {23232#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,980 INFO L290 TraceCheckUtils]: 96: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,981 INFO L290 TraceCheckUtils]: 97: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,981 INFO L290 TraceCheckUtils]: 98: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,981 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23212#true} {23232#(= main_~p~0 1)} #86#return; {23232#(= main_~p~0 1)} is VALID [2022-04-27 13:43:21,981 INFO L290 TraceCheckUtils]: 100: Hoare triple {23232#(= 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); {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,981 INFO L290 TraceCheckUtils]: 101: Hoare triple {23520#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,982 INFO L290 TraceCheckUtils]: 102: Hoare triple {23520#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,982 INFO L290 TraceCheckUtils]: 103: Hoare triple {23520#(<= main_~p~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,982 INFO L272 TraceCheckUtils]: 104: Hoare triple {23520#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,982 INFO L290 TraceCheckUtils]: 105: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,982 INFO L290 TraceCheckUtils]: 106: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,982 INFO L290 TraceCheckUtils]: 107: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,983 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23212#true} {23520#(<= main_~p~0 0)} #84#return; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,983 INFO L272 TraceCheckUtils]: 109: Hoare triple {23520#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:21,983 INFO L290 TraceCheckUtils]: 110: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:21,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:21,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:21,983 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23212#true} {23520#(<= main_~p~0 0)} #86#return; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:21,991 INFO L290 TraceCheckUtils]: 114: Hoare triple {23520#(<= main_~p~0 0)} assume !(1 != ~p~0); {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L272 TraceCheckUtils]: 115: Hoare triple {23213#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 116: Hoare triple {23213#false} ~cond := #in~cond; {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 117: Hoare triple {23213#false} assume !(0 == ~cond); {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 118: Hoare triple {23213#false} assume true; {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {23213#false} {23213#false} #88#return; {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L272 TraceCheckUtils]: 120: Hoare triple {23213#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 121: Hoare triple {23213#false} ~cond := #in~cond; {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 122: Hoare triple {23213#false} assume 0 == ~cond; {23213#false} is VALID [2022-04-27 13:43:21,992 INFO L290 TraceCheckUtils]: 123: Hoare triple {23213#false} assume !false; {23213#false} is VALID [2022-04-27 13:43:21,993 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:43:21,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:43:22,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {23213#false} assume !false; {23213#false} is VALID [2022-04-27 13:43:22,884 INFO L290 TraceCheckUtils]: 122: Hoare triple {23213#false} assume 0 == ~cond; {23213#false} is VALID [2022-04-27 13:43:22,884 INFO L290 TraceCheckUtils]: 121: Hoare triple {23213#false} ~cond := #in~cond; {23213#false} is VALID [2022-04-27 13:43:22,884 INFO L272 TraceCheckUtils]: 120: Hoare triple {23213#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {23213#false} is VALID [2022-04-27 13:43:22,884 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {23212#true} {23213#false} #88#return; {23213#false} is VALID [2022-04-27 13:43:22,884 INFO L290 TraceCheckUtils]: 118: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,884 INFO L272 TraceCheckUtils]: 115: Hoare triple {23213#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,885 INFO L290 TraceCheckUtils]: 114: Hoare triple {23520#(<= main_~p~0 0)} assume !(1 != ~p~0); {23213#false} is VALID [2022-04-27 13:43:22,885 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23212#true} {23520#(<= main_~p~0 0)} #86#return; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L290 TraceCheckUtils]: 111: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L290 TraceCheckUtils]: 110: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L272 TraceCheckUtils]: 109: Hoare triple {23520#(<= main_~p~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23212#true} {23520#(<= main_~p~0 0)} #84#return; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,886 INFO L290 TraceCheckUtils]: 107: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L290 TraceCheckUtils]: 106: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L290 TraceCheckUtils]: 105: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,886 INFO L272 TraceCheckUtils]: 104: Hoare triple {23520#(<= main_~p~0 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,887 INFO L290 TraceCheckUtils]: 103: Hoare triple {23520#(<= main_~p~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,887 INFO L290 TraceCheckUtils]: 102: Hoare triple {23520#(<= main_~p~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,887 INFO L290 TraceCheckUtils]: 101: Hoare triple {23520#(<= main_~p~0 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,888 INFO L290 TraceCheckUtils]: 100: Hoare triple {23659#(<= (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); {23520#(<= main_~p~0 0)} is VALID [2022-04-27 13:43:22,888 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23212#true} {23659#(<= (div main_~p~0 2) 0)} #86#return; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L272 TraceCheckUtils]: 95: Hoare triple {23659#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23212#true} {23659#(<= (div main_~p~0 2) 0)} #84#return; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 93: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 92: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L290 TraceCheckUtils]: 91: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,889 INFO L272 TraceCheckUtils]: 90: Hoare triple {23659#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,890 INFO L290 TraceCheckUtils]: 89: Hoare triple {23659#(<= (div main_~p~0 2) 0)} assume !!(#t~post6 < 10);havoc #t~post6; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,890 INFO L290 TraceCheckUtils]: 88: Hoare triple {23659#(<= (div main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,890 INFO L290 TraceCheckUtils]: 87: Hoare triple {23659#(<= (div main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,891 INFO L290 TraceCheckUtils]: 86: Hoare triple {23702#(<= (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); {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,892 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23212#true} {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #86#return; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,899 INFO L290 TraceCheckUtils]: 83: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,899 INFO L272 TraceCheckUtils]: 81: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,901 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23212#true} {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #84#return; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,901 INFO L272 TraceCheckUtils]: 76: Hoare triple {23702#(<= (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)); {23212#true} is VALID [2022-04-27 13:43:22,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {23702#(<= (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; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,903 INFO L290 TraceCheckUtils]: 72: Hoare triple {23745#(<= (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); {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,903 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23212#true} {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #86#return; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L272 TraceCheckUtils]: 67: Hoare triple {23745#(<= (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)); {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23212#true} {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #84#return; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,904 INFO L272 TraceCheckUtils]: 62: Hoare triple {23745#(<= (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)); {23212#true} is VALID [2022-04-27 13:43:22,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post6 < 10);havoc #t~post6; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !(~r~0 >= ~d~0); {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,906 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23212#true} {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #82#return; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,906 INFO L272 TraceCheckUtils]: 54: Hoare triple {23745#(<= (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)); {23212#true} is VALID [2022-04-27 13:43:22,907 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {23212#true} {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #80#return; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,908 INFO L272 TraceCheckUtils]: 49: Hoare triple {23745#(<= (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)); {23212#true} is VALID [2022-04-27 13:43:22,908 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {23212#true} {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #78#return; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,909 INFO L272 TraceCheckUtils]: 44: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} assume !!(#t~post5 < 10);havoc #t~post5; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {23702#(<= (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; {23745#(<= (div (+ (- 1) (div (+ (- 3) (* (- 1) (div main_~p~0 2))) 2)) (- 2)) 2)} is VALID [2022-04-27 13:43:22,911 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {23212#true} {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #82#return; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,912 INFO L272 TraceCheckUtils]: 36: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,912 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23212#true} {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #80#return; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,913 INFO L272 TraceCheckUtils]: 31: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,913 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {23212#true} {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #78#return; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,913 INFO L272 TraceCheckUtils]: 26: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} assume !!(#t~post5 < 10);havoc #t~post5; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {23659#(<= (div main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23702#(<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 1)} is VALID [2022-04-27 13:43:22,916 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23212#true} {23659#(<= (div main_~p~0 2) 0)} #82#return; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,916 INFO L272 TraceCheckUtils]: 18: Hoare triple {23659#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,916 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23212#true} {23659#(<= (div main_~p~0 2) 0)} #80#return; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L272 TraceCheckUtils]: 13: Hoare triple {23659#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23212#true} {23659#(<= (div main_~p~0 2) 0)} #78#return; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {23212#true} assume !(0 == ~cond); {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {23212#true} ~cond := #in~cond; {23212#true} is VALID [2022-04-27 13:43:22,917 INFO L272 TraceCheckUtils]: 8: Hoare triple {23659#(<= (div main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23212#true} is VALID [2022-04-27 13:43:22,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {23659#(<= (div main_~p~0 2) 0)} assume !!(#t~post5 < 10);havoc #t~post5; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {23659#(<= (div main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {23212#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; {23659#(<= (div main_~p~0 2) 0)} is VALID [2022-04-27 13:43:22,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {23212#true} call #t~ret7 := main(); {23212#true} is VALID [2022-04-27 13:43:22,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23212#true} {23212#true} #92#return; {23212#true} is VALID [2022-04-27 13:43:22,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {23212#true} assume true; {23212#true} is VALID [2022-04-27 13:43:22,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {23212#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; {23212#true} is VALID [2022-04-27 13:43:22,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {23212#true} call ULTIMATE.init(); {23212#true} is VALID [2022-04-27 13:43:22,919 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:43:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:43:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625064248] [2022-04-27 13:43:22,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:43:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496029141] [2022-04-27 13:43:22,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496029141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:43:22,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:43:22,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:43:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219831822] [2022-04-27 13:43:22,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:43:22,920 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:43:22,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:43:22,921 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:43:23,029 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:43:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:43:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:43:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:43:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:43:23,030 INFO L87 Difference]: Start difference. First operand 651 states and 842 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:43:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:23,842 INFO L93 Difference]: Finished difference Result 754 states and 969 transitions. [2022-04-27 13:43:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:43:23,842 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:43:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:43:23,842 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:43:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:43:23,844 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:43:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-04-27 13:43:23,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2022-04-27 13:43:23,954 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:43:23,973 INFO L225 Difference]: With dead ends: 754 [2022-04-27 13:43:23,973 INFO L226 Difference]: Without dead ends: 533 [2022-04-27 13:43:23,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:43:23,975 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:43:23,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:43:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-04-27 13:43:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 531. [2022-04-27 13:43:24,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:43:24,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 533 states. Second operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) [2022-04-27 13:43:24,395 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) [2022-04-27 13:43:24,395 INFO L87 Difference]: Start difference. First operand 533 states. Second operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) [2022-04-27 13:43:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:24,412 INFO L93 Difference]: Finished difference Result 533 states and 663 transitions. [2022-04-27 13:43:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 663 transitions. [2022-04-27 13:43:24,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:24,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:24,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) Second operand 533 states. [2022-04-27 13:43:24,416 INFO L87 Difference]: Start difference. First operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) Second operand 533 states. [2022-04-27 13:43:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:43:24,436 INFO L93 Difference]: Finished difference Result 533 states and 663 transitions. [2022-04-27 13:43:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 663 transitions. [2022-04-27 13:43:24,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:43:24,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:43:24,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:43:24,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:43:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 356 states have (on average 1.1882022471910112) internal successors, (423), 369 states have internal predecessors, (423), 121 states have call successors, (121), 55 states have call predecessors, (121), 53 states have return successors, (116), 106 states have call predecessors, (116), 116 states have call successors, (116) [2022-04-27 13:43:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 660 transitions. [2022-04-27 13:43:24,461 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 660 transitions. Word has length 124 [2022-04-27 13:43:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:43:24,461 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 660 transitions. [2022-04-27 13:43:24,461 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:43:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 660 transitions. [2022-04-27 13:43:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 13:43:24,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:43:24,463 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:43:24,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 13:43:24,679 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:43:24,679 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:43:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:43:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1372095454, now seen corresponding path program 3 times [2022-04-27 13:43:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:43:24,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031324118] [2022-04-27 13:43:24,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:43:24,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:43:24,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:43:24,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409045816] [2022-04-27 13:43:24,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:43:24,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:43:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:43:24,702 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:43:24,723 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:43:24,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:43:24,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:43:24,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 13:43:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:43:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:43:29,520 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:43:38,223 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:43:47,052 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:43:47,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {26763#true} call ULTIMATE.init(); {26763#true} is VALID [2022-04-27 13:43:47,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {26763#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; {26763#true} is VALID [2022-04-27 13:43:47,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26763#true} {26763#true} #92#return; {26763#true} is VALID [2022-04-27 13:43:47,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {26763#true} call #t~ret7 := main(); {26763#true} is VALID [2022-04-27 13:43:47,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {26763#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; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {26783#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #78#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,281 INFO L272 TraceCheckUtils]: 13: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,282 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #80#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,282 INFO L272 TraceCheckUtils]: 18: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,282 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #82#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {26783#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {26783#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,283 INFO L272 TraceCheckUtils]: 26: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,284 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #78#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,284 INFO L272 TraceCheckUtils]: 31: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,284 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #80#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,284 INFO L272 TraceCheckUtils]: 36: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,285 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #82#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {26783#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {26783#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,286 INFO L272 TraceCheckUtils]: 44: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,286 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #78#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,286 INFO L272 TraceCheckUtils]: 49: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #80#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,287 INFO L272 TraceCheckUtils]: 54: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,288 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #82#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {26783#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {26783#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,288 INFO L272 TraceCheckUtils]: 62: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #78#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,289 INFO L272 TraceCheckUtils]: 67: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 68: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 69: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,289 INFO L290 TraceCheckUtils]: 70: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,290 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #80#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,290 INFO L272 TraceCheckUtils]: 72: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,290 INFO L290 TraceCheckUtils]: 74: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,290 INFO L290 TraceCheckUtils]: 75: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,290 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #82#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {26783#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 78: Hoare triple {26783#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 79: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,291 INFO L272 TraceCheckUtils]: 80: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 82: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,291 INFO L290 TraceCheckUtils]: 83: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,292 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #84#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,292 INFO L272 TraceCheckUtils]: 85: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,292 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #86#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,293 INFO L290 TraceCheckUtils]: 90: Hoare triple {26783#(= 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); {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,293 INFO L290 TraceCheckUtils]: 91: Hoare triple {26783#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,293 INFO L290 TraceCheckUtils]: 92: Hoare triple {26783#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,293 INFO L290 TraceCheckUtils]: 93: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,293 INFO L272 TraceCheckUtils]: 94: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,293 INFO L290 TraceCheckUtils]: 95: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L290 TraceCheckUtils]: 96: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L290 TraceCheckUtils]: 97: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #84#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,294 INFO L272 TraceCheckUtils]: 99: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {26763#true} ~cond := #in~cond; {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L290 TraceCheckUtils]: 101: Hoare triple {26763#true} assume !(0 == ~cond); {26763#true} is VALID [2022-04-27 13:43:47,294 INFO L290 TraceCheckUtils]: 102: Hoare triple {26763#true} assume true; {26763#true} is VALID [2022-04-27 13:43:47,295 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {26763#true} {26783#(= main_~B~0 1)} #86#return; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,295 INFO L290 TraceCheckUtils]: 104: Hoare triple {26783#(= 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); {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,295 INFO L290 TraceCheckUtils]: 105: Hoare triple {26783#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,295 INFO L290 TraceCheckUtils]: 106: Hoare triple {26783#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,296 INFO L290 TraceCheckUtils]: 107: Hoare triple {26783#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26783#(= main_~B~0 1)} is VALID [2022-04-27 13:43:47,296 INFO L272 TraceCheckUtils]: 108: Hoare triple {26783#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {26763#true} is VALID [2022-04-27 13:43:47,296 INFO L290 TraceCheckUtils]: 109: Hoare triple {26763#true} ~cond := #in~cond; {27096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:43:47,296 INFO L290 TraceCheckUtils]: 110: Hoare triple {27096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:43:47,297 INFO L290 TraceCheckUtils]: 111: Hoare triple {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:43:47,297 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} {26783#(= main_~B~0 1)} #84#return; {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:43:47,297 INFO L272 TraceCheckUtils]: 113: Hoare triple {27107#(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)); {26763#true} is VALID [2022-04-27 13:43:47,298 INFO L290 TraceCheckUtils]: 114: Hoare triple {26763#true} ~cond := #in~cond; {27096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:43:47,298 INFO L290 TraceCheckUtils]: 115: Hoare triple {27096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:43:47,298 INFO L290 TraceCheckUtils]: 116: Hoare triple {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:43:47,299 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {27100#(not (= |__VERIFIER_assert_#in~cond| 0))} {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {27123#(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:43:47,300 INFO L290 TraceCheckUtils]: 118: Hoare triple {27123#(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); {27123#(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:43:47,301 INFO L290 TraceCheckUtils]: 119: Hoare triple {27123#(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; {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:43:47,302 INFO L290 TraceCheckUtils]: 120: Hoare triple {27107#(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; {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:43:47,302 INFO L290 TraceCheckUtils]: 121: Hoare triple {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} assume !!(#t~post6 < 10);havoc #t~post6; {27107#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-27 13:43:47,303 INFO L272 TraceCheckUtils]: 122: Hoare triple {27107#(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)); {27139#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:43:47,303 INFO L290 TraceCheckUtils]: 123: Hoare triple {27139#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27143#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:43:47,303 INFO L290 TraceCheckUtils]: 124: Hoare triple {27143#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26764#false} is VALID [2022-04-27 13:43:47,303 INFO L290 TraceCheckUtils]: 125: Hoare triple {26764#false} assume !false; {26764#false} is VALID [2022-04-27 13:43:47,304 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:43:47,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:44:13,178 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 13:49:46,816 WARN L232 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 13:52:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:52:19,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031324118] [2022-04-27 13:52:19,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:52:19,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409045816] [2022-04-27 13:52:19,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409045816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:52:19,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:52:19,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:52:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855788404] [2022-04-27 13:52:19,132 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:52:19,133 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 13:52:19,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:52:19,133 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 13:52:19,173 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 13:52:19,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:52:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:52:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:52:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=166, Unknown=2, NotChecked=26, Total=240 [2022-04-27 13:52:19,174 INFO L87 Difference]: Start difference. First operand 531 states and 660 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 13:52:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:19,861 INFO L93 Difference]: Finished difference Result 545 states and 673 transitions. [2022-04-27 13:52:19,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:52:19,862 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 13:52:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:52:19,862 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 13:52:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 13:52:19,863 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 13:52:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-27 13:52:19,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-27 13:52:19,908 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 13:52:19,927 INFO L225 Difference]: With dead ends: 545 [2022-04-27 13:52:19,927 INFO L226 Difference]: Without dead ends: 539 [2022-04-27 13:52:19,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=59, Invalid=215, Unknown=2, NotChecked=30, Total=306 [2022-04-27 13:52:19,928 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:52:19,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 72 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:52:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-04-27 13:52:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 441. [2022-04-27 13:52:20,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:52:20,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-27 13:52:20,234 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-27 13:52:20,235 INFO L87 Difference]: Start difference. First operand 539 states. Second operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-27 13:52:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:20,251 INFO L93 Difference]: Finished difference Result 539 states and 665 transitions. [2022-04-27 13:52:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2022-04-27 13:52:20,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:20,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:20,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) Second operand 539 states. [2022-04-27 13:52:20,254 INFO L87 Difference]: Start difference. First operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) Second operand 539 states. [2022-04-27 13:52:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:20,270 INFO L93 Difference]: Finished difference Result 539 states and 665 transitions. [2022-04-27 13:52:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 665 transitions. [2022-04-27 13:52:20,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:20,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:20,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:52:20,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:52:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 298 states have (on average 1.157718120805369) internal successors, (345), 300 states have internal predecessors, (345), 93 states have call successors, (93), 51 states have call predecessors, (93), 49 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-27 13:52:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 528 transitions. [2022-04-27 13:52:20,286 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 528 transitions. Word has length 126 [2022-04-27 13:52:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:52:20,286 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 528 transitions. [2022-04-27 13:52:20,286 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 13:52:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 528 transitions. [2022-04-27 13:52:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 13:52:20,288 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:52:20,288 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 13:52:20,311 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 13:52:20,503 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 13:52:20,503 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:52:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:52:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 388866286, now seen corresponding path program 3 times [2022-04-27 13:52:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:52:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701597] [2022-04-27 13:52:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:52:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:52:20,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:52:20,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [337623268] [2022-04-27 13:52:20,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:52:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:52:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:52:20,519 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 13:52:20,523 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 13:52:20,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:52:20,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:52:20,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:52:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:52:20,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:52:20,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {29638#true} call ULTIMATE.init(); {29638#true} is VALID [2022-04-27 13:52:20,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {29638#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; {29638#true} is VALID [2022-04-27 13:52:20,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29638#true} {29638#true} #92#return; {29638#true} is VALID [2022-04-27 13:52:20,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {29638#true} call #t~ret7 := main(); {29638#true} is VALID [2022-04-27 13:52:20,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {29638#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; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {29658#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,891 INFO L272 TraceCheckUtils]: 8: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #78#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,891 INFO L272 TraceCheckUtils]: 13: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,892 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #80#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,892 INFO L272 TraceCheckUtils]: 18: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,893 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #82#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {29658#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {29658#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,894 INFO L272 TraceCheckUtils]: 26: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,894 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #78#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,894 INFO L272 TraceCheckUtils]: 31: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #80#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,895 INFO L272 TraceCheckUtils]: 36: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,896 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #82#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {29658#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {29658#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,897 INFO L272 TraceCheckUtils]: 44: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,898 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #78#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,898 INFO L272 TraceCheckUtils]: 49: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,898 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #80#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,898 INFO L272 TraceCheckUtils]: 54: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,899 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #82#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {29658#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {29658#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,900 INFO L272 TraceCheckUtils]: 62: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,900 INFO L290 TraceCheckUtils]: 65: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,901 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #78#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,901 INFO L272 TraceCheckUtils]: 67: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,902 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #80#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,902 INFO L272 TraceCheckUtils]: 72: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,902 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #82#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 77: Hoare triple {29658#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 78: Hoare triple {29658#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 79: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,903 INFO L272 TraceCheckUtils]: 80: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,903 INFO L290 TraceCheckUtils]: 83: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,904 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #84#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,904 INFO L272 TraceCheckUtils]: 85: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,904 INFO L290 TraceCheckUtils]: 86: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,904 INFO L290 TraceCheckUtils]: 87: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,904 INFO L290 TraceCheckUtils]: 88: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,905 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #86#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,905 INFO L290 TraceCheckUtils]: 90: Hoare triple {29658#(= 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); {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,905 INFO L290 TraceCheckUtils]: 91: Hoare triple {29658#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,906 INFO L290 TraceCheckUtils]: 92: Hoare triple {29658#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,906 INFO L290 TraceCheckUtils]: 93: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,906 INFO L272 TraceCheckUtils]: 94: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,906 INFO L290 TraceCheckUtils]: 95: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,906 INFO L290 TraceCheckUtils]: 97: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,907 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #84#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,907 INFO L272 TraceCheckUtils]: 99: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,907 INFO L290 TraceCheckUtils]: 100: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,907 INFO L290 TraceCheckUtils]: 101: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,907 INFO L290 TraceCheckUtils]: 102: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,907 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #86#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,908 INFO L290 TraceCheckUtils]: 104: Hoare triple {29658#(= 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); {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,908 INFO L290 TraceCheckUtils]: 105: Hoare triple {29658#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,908 INFO L290 TraceCheckUtils]: 106: Hoare triple {29658#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,908 INFO L290 TraceCheckUtils]: 107: Hoare triple {29658#(= main_~B~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,909 INFO L272 TraceCheckUtils]: 108: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,909 INFO L290 TraceCheckUtils]: 109: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,909 INFO L290 TraceCheckUtils]: 110: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,909 INFO L290 TraceCheckUtils]: 111: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,909 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {29638#true} {29658#(= main_~B~0 1)} #84#return; {29658#(= main_~B~0 1)} is VALID [2022-04-27 13:52:20,909 INFO L272 TraceCheckUtils]: 113: Hoare triple {29658#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:20,910 INFO L290 TraceCheckUtils]: 114: Hoare triple {29638#true} ~cond := #in~cond; {29986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:20,910 INFO L290 TraceCheckUtils]: 115: Hoare triple {29986#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:20,910 INFO L290 TraceCheckUtils]: 116: Hoare triple {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:20,911 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} {29658#(= main_~B~0 1)} #86#return; {29997#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-27 13:52:20,911 INFO L290 TraceCheckUtils]: 118: Hoare triple {29997#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~B~0 1))} assume !(1 != ~p~0); {30001#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:20,911 INFO L272 TraceCheckUtils]: 119: Hoare triple {30001#(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)); {29638#true} is VALID [2022-04-27 13:52:20,911 INFO L290 TraceCheckUtils]: 120: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:20,912 INFO L290 TraceCheckUtils]: 121: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:20,912 INFO L290 TraceCheckUtils]: 122: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:20,912 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {29638#true} {30001#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} #88#return; {30001#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:20,913 INFO L272 TraceCheckUtils]: 124: Hoare triple {30001#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {30020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:52:20,913 INFO L290 TraceCheckUtils]: 125: Hoare triple {30020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:20,913 INFO L290 TraceCheckUtils]: 126: Hoare triple {30024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29639#false} is VALID [2022-04-27 13:52:20,913 INFO L290 TraceCheckUtils]: 127: Hoare triple {29639#false} assume !false; {29639#false} is VALID [2022-04-27 13:52:20,914 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 13:52:20,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:52:25,301 INFO L290 TraceCheckUtils]: 127: Hoare triple {29639#false} assume !false; {29639#false} is VALID [2022-04-27 13:52:25,302 INFO L290 TraceCheckUtils]: 126: Hoare triple {30024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29639#false} is VALID [2022-04-27 13:52:25,302 INFO L290 TraceCheckUtils]: 125: Hoare triple {30020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:25,302 INFO L272 TraceCheckUtils]: 124: Hoare triple {30040#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {30020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:52:25,303 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {29638#true} {30040#(= main_~B~0 main_~d~0)} #88#return; {30040#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:52:25,303 INFO L290 TraceCheckUtils]: 122: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,303 INFO L290 TraceCheckUtils]: 121: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,303 INFO L290 TraceCheckUtils]: 120: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,303 INFO L272 TraceCheckUtils]: 119: Hoare triple {30040#(= main_~B~0 main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,303 INFO L290 TraceCheckUtils]: 118: Hoare triple {30059#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} assume !(1 != ~p~0); {30040#(= main_~B~0 main_~d~0)} is VALID [2022-04-27 13:52:25,304 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} {29638#true} #86#return; {30059#(or (not (= main_~p~0 1)) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:25,305 INFO L290 TraceCheckUtils]: 116: Hoare triple {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:25,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {30072#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {29990#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:25,305 INFO L290 TraceCheckUtils]: 114: Hoare triple {29638#true} ~cond := #in~cond; {30072#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:52:25,305 INFO L272 TraceCheckUtils]: 113: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,305 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {29638#true} {29638#true} #84#return; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 111: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L272 TraceCheckUtils]: 108: Hoare triple {29638#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {29638#true} assume !!(#t~post6 < 10);havoc #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 106: Hoare triple {29638#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 105: Hoare triple {29638#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {29638#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); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {29638#true} {29638#true} #86#return; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 102: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 101: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L272 TraceCheckUtils]: 99: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29638#true} {29638#true} #84#return; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 96: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L272 TraceCheckUtils]: 94: Hoare triple {29638#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {29638#true} assume !!(#t~post6 < 10);havoc #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {29638#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {29638#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {29638#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); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29638#true} {29638#true} #86#return; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 86: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L272 TraceCheckUtils]: 85: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29638#true} {29638#true} #84#return; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 81: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L272 TraceCheckUtils]: 80: Hoare triple {29638#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {29638#true} assume !!(#t~post6 < 10);havoc #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {29638#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {29638#true} assume !(~r~0 >= ~d~0); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29638#true} {29638#true} #82#return; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 75: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L272 TraceCheckUtils]: 72: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29638#true} {29638#true} #80#return; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 70: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L272 TraceCheckUtils]: 67: Hoare triple {29638#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29638#true} {29638#true} #78#return; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L272 TraceCheckUtils]: 62: Hoare triple {29638#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {29638#true} assume !!(#t~post5 < 10);havoc #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 60: Hoare triple {29638#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 59: Hoare triple {29638#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29638#true} {29638#true} #82#return; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L272 TraceCheckUtils]: 54: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29638#true} {29638#true} #80#return; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L272 TraceCheckUtils]: 49: Hoare triple {29638#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29638#true} {29638#true} #78#return; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L272 TraceCheckUtils]: 44: Hoare triple {29638#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {29638#true} assume !!(#t~post5 < 10);havoc #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {29638#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {29638#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29638#true} {29638#true} #82#return; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L272 TraceCheckUtils]: 36: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29638#true} {29638#true} #80#return; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L272 TraceCheckUtils]: 31: Hoare triple {29638#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29638#true} {29638#true} #78#return; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L272 TraceCheckUtils]: 26: Hoare triple {29638#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {29638#true} assume !!(#t~post5 < 10);havoc #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {29638#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {29638#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29638#true} {29638#true} #82#return; {29638#true} is VALID [2022-04-27 13:52:25,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L272 TraceCheckUtils]: 18: Hoare triple {29638#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29638#true} {29638#true} #80#return; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {29638#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29638#true} {29638#true} #78#return; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {29638#true} assume !(0 == ~cond); {29638#true} is VALID [2022-04-27 13:52:25,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {29638#true} ~cond := #in~cond; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L272 TraceCheckUtils]: 8: Hoare triple {29638#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {29638#true} assume !!(#t~post5 < 10);havoc #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {29638#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {29638#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; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {29638#true} call #t~ret7 := main(); {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29638#true} {29638#true} #92#return; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {29638#true} assume true; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {29638#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; {29638#true} is VALID [2022-04-27 13:52:25,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {29638#true} call ULTIMATE.init(); {29638#true} is VALID [2022-04-27 13:52:25,314 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 13:52:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:52:25,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701597] [2022-04-27 13:52:25,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:52:25,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337623268] [2022-04-27 13:52:25,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337623268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:52:25,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:52:25,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 13:52:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785914700] [2022-04-27 13:52:25,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:52:25,315 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 13:52:25,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:52:25,316 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 13:52:25,362 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 13:52:25,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:52:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:52:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:52:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:52:25,363 INFO L87 Difference]: Start difference. First operand 441 states and 528 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 13:52:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:26,186 INFO L93 Difference]: Finished difference Result 485 states and 563 transitions. [2022-04-27 13:52:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:52:26,186 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 13:52:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:52:26,186 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 13:52:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 13:52:26,187 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 13:52:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-27 13:52:26,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-27 13:52:26,252 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:52:26,268 INFO L225 Difference]: With dead ends: 485 [2022-04-27 13:52:26,268 INFO L226 Difference]: Without dead ends: 469 [2022-04-27 13:52:26,268 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 13:52:26,269 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:52:26,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 145 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:52:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-27 13:52:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 357. [2022-04-27 13:52:26,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:52:26,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:52:26,565 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:52:26,566 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:52:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:26,578 INFO L93 Difference]: Finished difference Result 469 states and 535 transitions. [2022-04-27 13:52:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 535 transitions. [2022-04-27 13:52:26,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:26,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:26,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) Second operand 469 states. [2022-04-27 13:52:26,580 INFO L87 Difference]: Start difference. First operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) Second operand 469 states. [2022-04-27 13:52:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:26,593 INFO L93 Difference]: Finished difference Result 469 states and 535 transitions. [2022-04-27 13:52:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 535 transitions. [2022-04-27 13:52:26,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:26,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:26,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:52:26,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:52:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 247 states have internal predecessors, (263), 67 states have call successors, (67), 50 states have call predecessors, (67), 49 states have return successors, (65), 59 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:52:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 395 transitions. [2022-04-27 13:52:26,605 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 395 transitions. Word has length 128 [2022-04-27 13:52:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:52:26,605 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 395 transitions. [2022-04-27 13:52:26,605 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 13:52:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 395 transitions. [2022-04-27 13:52:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-27 13:52:26,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:52:26,607 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:52:26,636 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 13:52:26,823 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 13:52:26,823 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:52:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:52:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash -216125860, now seen corresponding path program 2 times [2022-04-27 13:52:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:52:26,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880237833] [2022-04-27 13:52:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:52:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:52:26,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:52:26,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882354159] [2022-04-27 13:52:26,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:52:26,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:52:26,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:52:26,846 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 13:52:26,853 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 13:52:26,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:52:26,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:52:26,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:52:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:52:26,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:52:27,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2022-04-27 13:52:27,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {32499#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; {32499#true} is VALID [2022-04-27 13:52:27,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #92#return; {32499#true} is VALID [2022-04-27 13:52:27,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret7 := main(); {32499#true} is VALID [2022-04-27 13:52:27,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {32499#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; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {32519#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {32519#(= main_~p~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,262 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #78#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,262 INFO L272 TraceCheckUtils]: 13: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,274 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #80#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,274 INFO L272 TraceCheckUtils]: 18: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,275 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #82#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {32519#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {32574#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {32574#(= main_~p~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,276 INFO L272 TraceCheckUtils]: 26: Hoare triple {32574#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32499#true} {32574#(= main_~p~0 2)} #78#return; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,277 INFO L272 TraceCheckUtils]: 31: Hoare triple {32574#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32499#true} {32574#(= main_~p~0 2)} #80#return; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,277 INFO L272 TraceCheckUtils]: 36: Hoare triple {32574#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,278 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32499#true} {32574#(= main_~p~0 2)} #82#return; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {32574#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {32629#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {32629#(= main_~p~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,279 INFO L272 TraceCheckUtils]: 44: Hoare triple {32629#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,279 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32499#true} {32629#(= main_~p~0 4)} #78#return; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,279 INFO L272 TraceCheckUtils]: 49: Hoare triple {32629#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32499#true} {32629#(= main_~p~0 4)} #80#return; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,280 INFO L272 TraceCheckUtils]: 54: Hoare triple {32629#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,281 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32499#true} {32629#(= main_~p~0 4)} #82#return; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {32629#(= main_~p~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {32684#(= main_~p~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {32684#(= main_~p~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,282 INFO L272 TraceCheckUtils]: 62: Hoare triple {32684#(= main_~p~0 8)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32499#true} {32684#(= main_~p~0 8)} #78#return; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,282 INFO L272 TraceCheckUtils]: 67: Hoare triple {32684#(= main_~p~0 8)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,283 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32499#true} {32684#(= main_~p~0 8)} #80#return; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,283 INFO L272 TraceCheckUtils]: 72: Hoare triple {32684#(= main_~p~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,283 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32499#true} {32684#(= main_~p~0 8)} #82#return; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {32684#(= main_~p~0 8)} assume !(~r~0 >= ~d~0); {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {32684#(= main_~p~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {32684#(= main_~p~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,284 INFO L272 TraceCheckUtils]: 80: Hoare triple {32684#(= main_~p~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,284 INFO L290 TraceCheckUtils]: 83: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,285 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32499#true} {32684#(= main_~p~0 8)} #84#return; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,285 INFO L272 TraceCheckUtils]: 85: Hoare triple {32684#(= main_~p~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,285 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {32499#true} {32684#(= main_~p~0 8)} #86#return; {32684#(= main_~p~0 8)} is VALID [2022-04-27 13:52:27,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {32684#(= main_~p~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); {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,286 INFO L290 TraceCheckUtils]: 91: Hoare triple {32629#(= main_~p~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,286 INFO L290 TraceCheckUtils]: 92: Hoare triple {32629#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,287 INFO L290 TraceCheckUtils]: 93: Hoare triple {32629#(= main_~p~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,287 INFO L272 TraceCheckUtils]: 94: Hoare triple {32629#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,287 INFO L290 TraceCheckUtils]: 95: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,287 INFO L290 TraceCheckUtils]: 96: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,287 INFO L290 TraceCheckUtils]: 97: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,287 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {32499#true} {32629#(= main_~p~0 4)} #84#return; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,287 INFO L272 TraceCheckUtils]: 99: Hoare triple {32629#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,288 INFO L290 TraceCheckUtils]: 100: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,288 INFO L290 TraceCheckUtils]: 101: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,288 INFO L290 TraceCheckUtils]: 102: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,288 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32499#true} {32629#(= main_~p~0 4)} #86#return; {32629#(= main_~p~0 4)} is VALID [2022-04-27 13:52:27,288 INFO L290 TraceCheckUtils]: 104: Hoare triple {32629#(= 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); {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,289 INFO L290 TraceCheckUtils]: 105: Hoare triple {32574#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,289 INFO L290 TraceCheckUtils]: 106: Hoare triple {32574#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,289 INFO L290 TraceCheckUtils]: 107: Hoare triple {32574#(= main_~p~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,289 INFO L272 TraceCheckUtils]: 108: Hoare triple {32574#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,289 INFO L290 TraceCheckUtils]: 109: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L290 TraceCheckUtils]: 110: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L290 TraceCheckUtils]: 111: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {32499#true} {32574#(= main_~p~0 2)} #84#return; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,290 INFO L272 TraceCheckUtils]: 113: Hoare triple {32574#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L290 TraceCheckUtils]: 114: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L290 TraceCheckUtils]: 115: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,290 INFO L290 TraceCheckUtils]: 116: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,291 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {32499#true} {32574#(= main_~p~0 2)} #86#return; {32574#(= main_~p~0 2)} is VALID [2022-04-27 13:52:27,291 INFO L290 TraceCheckUtils]: 118: Hoare triple {32574#(= 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); {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {32519#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,292 INFO L290 TraceCheckUtils]: 120: Hoare triple {32519#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,292 INFO L290 TraceCheckUtils]: 121: Hoare triple {32519#(= main_~p~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,292 INFO L272 TraceCheckUtils]: 122: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,292 INFO L290 TraceCheckUtils]: 123: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,292 INFO L290 TraceCheckUtils]: 124: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,292 INFO L290 TraceCheckUtils]: 125: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,293 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #84#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,293 INFO L272 TraceCheckUtils]: 127: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:27,293 INFO L290 TraceCheckUtils]: 128: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:27,293 INFO L290 TraceCheckUtils]: 129: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:27,293 INFO L290 TraceCheckUtils]: 130: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:27,293 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #86#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:27,293 INFO L290 TraceCheckUtils]: 132: Hoare triple {32519#(= 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); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 133: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 134: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 135: Hoare triple {32500#false} assume !!(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L272 TraceCheckUtils]: 136: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 137: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 138: Hoare triple {32500#false} assume !(0 == ~cond); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 139: Hoare triple {32500#false} assume true; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32500#false} {32500#false} #84#return; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L272 TraceCheckUtils]: 141: Hoare triple {32500#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 142: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 143: Hoare triple {32500#false} assume !(0 == ~cond); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 144: Hoare triple {32500#false} assume true; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {32500#false} {32500#false} #86#return; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 146: Hoare triple {32500#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); {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 147: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 148: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,294 INFO L290 TraceCheckUtils]: 149: Hoare triple {32500#false} assume !!(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L272 TraceCheckUtils]: 150: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 151: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 152: Hoare triple {32500#false} assume !(0 == ~cond); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 153: Hoare triple {32500#false} assume true; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {32500#false} {32500#false} #84#return; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L272 TraceCheckUtils]: 155: Hoare triple {32500#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 156: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 157: Hoare triple {32500#false} assume !(0 == ~cond); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 158: Hoare triple {32500#false} assume true; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {32500#false} {32500#false} #86#return; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 160: Hoare triple {32500#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); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 161: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 162: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 163: Hoare triple {32500#false} assume !(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L272 TraceCheckUtils]: 164: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 165: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 166: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2022-04-27 13:52:27,295 INFO L290 TraceCheckUtils]: 167: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2022-04-27 13:52:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 417 proven. 69 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-04-27 13:52:27,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:52:28,062 INFO L290 TraceCheckUtils]: 167: Hoare triple {32500#false} assume !false; {32500#false} is VALID [2022-04-27 13:52:28,062 INFO L290 TraceCheckUtils]: 166: Hoare triple {32500#false} assume 0 == ~cond; {32500#false} is VALID [2022-04-27 13:52:28,062 INFO L290 TraceCheckUtils]: 165: Hoare triple {32500#false} ~cond := #in~cond; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L272 TraceCheckUtils]: 164: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 163: Hoare triple {32500#false} assume !(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 162: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 161: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 160: Hoare triple {32500#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); {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {32499#true} {32500#false} #86#return; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 158: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 157: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 156: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L272 TraceCheckUtils]: 155: Hoare triple {32500#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {32499#true} {32500#false} #84#return; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 153: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 152: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 151: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L272 TraceCheckUtils]: 150: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 149: Hoare triple {32500#false} assume !!(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,063 INFO L290 TraceCheckUtils]: 148: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 147: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 146: Hoare triple {32500#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); {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {32499#true} {32500#false} #86#return; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 144: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 142: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L272 TraceCheckUtils]: 141: Hoare triple {32500#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32499#true} {32500#false} #84#return; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 139: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 138: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 137: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L272 TraceCheckUtils]: 136: Hoare triple {32500#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 135: Hoare triple {32500#false} assume !!(#t~post6 < 10);havoc #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 134: Hoare triple {32500#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32500#false} is VALID [2022-04-27 13:52:28,064 INFO L290 TraceCheckUtils]: 133: Hoare triple {32500#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32500#false} is VALID [2022-04-27 13:52:28,065 INFO L290 TraceCheckUtils]: 132: Hoare triple {32519#(= 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); {32500#false} is VALID [2022-04-27 13:52:28,065 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #86#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,065 INFO L290 TraceCheckUtils]: 130: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,065 INFO L290 TraceCheckUtils]: 129: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,065 INFO L290 TraceCheckUtils]: 128: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,065 INFO L272 TraceCheckUtils]: 127: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,066 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #84#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,066 INFO L290 TraceCheckUtils]: 125: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,066 INFO L290 TraceCheckUtils]: 124: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,066 INFO L290 TraceCheckUtils]: 123: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,066 INFO L272 TraceCheckUtils]: 122: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,066 INFO L290 TraceCheckUtils]: 121: Hoare triple {32519#(= main_~p~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,067 INFO L290 TraceCheckUtils]: 120: Hoare triple {32519#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,067 INFO L290 TraceCheckUtils]: 119: Hoare triple {32519#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,068 INFO L290 TraceCheckUtils]: 118: Hoare triple {33156#(= (div main_~p~0 2) 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,068 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {32499#true} {33156#(= (div main_~p~0 2) 1)} #86#return; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,068 INFO L290 TraceCheckUtils]: 116: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,068 INFO L290 TraceCheckUtils]: 115: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,068 INFO L290 TraceCheckUtils]: 114: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,068 INFO L272 TraceCheckUtils]: 113: Hoare triple {33156#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,069 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {32499#true} {33156#(= (div main_~p~0 2) 1)} #84#return; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,069 INFO L290 TraceCheckUtils]: 111: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,069 INFO L290 TraceCheckUtils]: 110: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,069 INFO L290 TraceCheckUtils]: 109: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,069 INFO L272 TraceCheckUtils]: 108: Hoare triple {33156#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,069 INFO L290 TraceCheckUtils]: 107: Hoare triple {33156#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 10);havoc #t~post6; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,069 INFO L290 TraceCheckUtils]: 106: Hoare triple {33156#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,070 INFO L290 TraceCheckUtils]: 105: Hoare triple {33156#(= (div main_~p~0 2) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,071 INFO L290 TraceCheckUtils]: 104: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,072 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {32499#true} {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #86#return; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,072 INFO L290 TraceCheckUtils]: 102: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,072 INFO L290 TraceCheckUtils]: 101: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,072 INFO L290 TraceCheckUtils]: 100: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,072 INFO L272 TraceCheckUtils]: 99: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,072 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {32499#true} {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #84#return; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,073 INFO L290 TraceCheckUtils]: 95: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,073 INFO L272 TraceCheckUtils]: 94: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,073 INFO L290 TraceCheckUtils]: 93: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post6 < 10);havoc #t~post6; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,073 INFO L290 TraceCheckUtils]: 92: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 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); {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,082 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {32499#true} {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #86#return; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 87: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 86: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L272 TraceCheckUtils]: 85: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32499#true} {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #84#return; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 82: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,083 INFO L272 TraceCheckUtils]: 80: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,084 INFO L290 TraceCheckUtils]: 79: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} assume !!(#t~post6 < 10);havoc #t~post6; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,084 INFO L290 TraceCheckUtils]: 78: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,085 INFO L290 TraceCheckUtils]: 77: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} assume !(~r~0 >= ~d~0); {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,085 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32499#true} {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #82#return; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,085 INFO L290 TraceCheckUtils]: 75: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,085 INFO L290 TraceCheckUtils]: 74: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,085 INFO L290 TraceCheckUtils]: 73: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,085 INFO L272 TraceCheckUtils]: 72: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,086 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32499#true} {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #80#return; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,086 INFO L290 TraceCheckUtils]: 70: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,086 INFO L290 TraceCheckUtils]: 69: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,086 INFO L272 TraceCheckUtils]: 67: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,089 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32499#true} {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #78#return; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,089 INFO L290 TraceCheckUtils]: 65: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,089 INFO L290 TraceCheckUtils]: 64: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,089 INFO L290 TraceCheckUtils]: 63: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,089 INFO L272 TraceCheckUtils]: 62: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33242#(and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))} is VALID [2022-04-27 13:52:28,092 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32499#true} {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #82#return; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,092 INFO L272 TraceCheckUtils]: 54: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,092 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32499#true} {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #80#return; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L272 TraceCheckUtils]: 49: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32499#true} {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #78#return; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,093 INFO L272 TraceCheckUtils]: 44: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {33156#(= (div main_~p~0 2) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33199#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-27 13:52:28,095 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32499#true} {33156#(= (div main_~p~0 2) 1)} #82#return; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,096 INFO L272 TraceCheckUtils]: 36: Hoare triple {33156#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,103 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32499#true} {33156#(= (div main_~p~0 2) 1)} #80#return; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L272 TraceCheckUtils]: 31: Hoare triple {33156#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32499#true} {33156#(= (div main_~p~0 2) 1)} #78#return; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,105 INFO L272 TraceCheckUtils]: 26: Hoare triple {33156#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {33156#(= (div main_~p~0 2) 1)} assume !!(#t~post5 < 10);havoc #t~post5; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {33156#(= (div main_~p~0 2) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {32519#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33156#(= (div main_~p~0 2) 1)} is VALID [2022-04-27 13:52:28,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #82#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,107 INFO L272 TraceCheckUtils]: 18: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,107 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #80#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L272 TraceCheckUtils]: 13: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32499#true} {32519#(= main_~p~0 1)} #78#return; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {32499#true} assume !(0 == ~cond); {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {32499#true} ~cond := #in~cond; {32499#true} is VALID [2022-04-27 13:52:28,108 INFO L272 TraceCheckUtils]: 8: Hoare triple {32519#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32499#true} is VALID [2022-04-27 13:52:28,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {32519#(= main_~p~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {32519#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {32499#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; {32519#(= main_~p~0 1)} is VALID [2022-04-27 13:52:28,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {32499#true} call #t~ret7 := main(); {32499#true} is VALID [2022-04-27 13:52:28,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32499#true} {32499#true} #92#return; {32499#true} is VALID [2022-04-27 13:52:28,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {32499#true} assume true; {32499#true} is VALID [2022-04-27 13:52:28,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {32499#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; {32499#true} is VALID [2022-04-27 13:52:28,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {32499#true} call ULTIMATE.init(); {32499#true} is VALID [2022-04-27 13:52:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 105 proven. 69 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2022-04-27 13:52:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:52:28,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880237833] [2022-04-27 13:52:28,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:52:28,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882354159] [2022-04-27 13:52:28,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882354159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:52:28,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:52:28,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:52:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363452053] [2022-04-27 13:52:28,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:52:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 168 [2022-04-27 13:52:28,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:52:28,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-04-27 13:52:28,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:52:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:52:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:52:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:52:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:52:28,268 INFO L87 Difference]: Start difference. First operand 357 states and 395 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-04-27 13:52:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:29,145 INFO L93 Difference]: Finished difference Result 448 states and 507 transitions. [2022-04-27 13:52:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:52:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 168 [2022-04-27 13:52:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:52:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-04-27 13:52:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:52:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-04-27 13:52:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:52:29,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-27 13:52:29,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:52:29,258 INFO L225 Difference]: With dead ends: 448 [2022-04-27 13:52:29,258 INFO L226 Difference]: Without dead ends: 329 [2022-04-27 13:52:29,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:52:29,259 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:52:29,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 412 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:52:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-27 13:52:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-04-27 13:52:29,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:52:29,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 13:52:29,526 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 13:52:29,526 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 13:52:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:29,532 INFO L93 Difference]: Finished difference Result 329 states and 361 transitions. [2022-04-27 13:52:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2022-04-27 13:52:29,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:29,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:29,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 329 states. [2022-04-27 13:52:29,534 INFO L87 Difference]: Start difference. First operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 329 states. [2022-04-27 13:52:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:52:29,541 INFO L93 Difference]: Finished difference Result 329 states and 361 transitions. [2022-04-27 13:52:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2022-04-27 13:52:29,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:52:29,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:52:29,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:52:29,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:52:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 221 states have (on average 1.090497737556561) internal successors, (241), 227 states have internal predecessors, (241), 61 states have call successors, (61), 47 states have call predecessors, (61), 46 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 13:52:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 361 transitions. [2022-04-27 13:52:29,550 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 361 transitions. Word has length 168 [2022-04-27 13:52:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:52:29,551 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 361 transitions. [2022-04-27 13:52:29,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 9 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-04-27 13:52:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 361 transitions. [2022-04-27 13:52:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-27 13:52:29,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:52:29,555 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:52:29,583 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 13:52:29,780 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 13:52:29,781 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:52:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:52:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 657547478, now seen corresponding path program 3 times [2022-04-27 13:52:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:52:29,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903585699] [2022-04-27 13:52:29,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:52:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:52:29,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:52:29,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866054901] [2022-04-27 13:52:29,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:52:29,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:52:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:52:29,798 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 13:52:29,800 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 13:52:29,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-27 13:52:29,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:52:29,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:52:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:52:29,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:52:36,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {35224#true} call ULTIMATE.init(); {35224#true} is VALID [2022-04-27 13:52:36,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {35224#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; {35224#true} is VALID [2022-04-27 13:52:36,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35224#true} {35224#true} #92#return; {35224#true} is VALID [2022-04-27 13:52:36,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {35224#true} call #t~ret7 := main(); {35224#true} is VALID [2022-04-27 13:52:36,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {35224#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; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} assume !!(#t~post5 < 10);havoc #t~post5; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,008 INFO L272 TraceCheckUtils]: 8: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,009 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35224#true} {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} #78#return; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,009 INFO L272 TraceCheckUtils]: 13: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,010 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35224#true} {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} #80#return; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,010 INFO L272 TraceCheckUtils]: 18: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,011 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35224#true} {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} #82#return; {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:52:36,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {35244#(and (= main_~B~0 1) (= main_~p~0 1) (<= main_~B~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,013 INFO L272 TraceCheckUtils]: 26: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,014 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35224#true} {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #78#return; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,014 INFO L272 TraceCheckUtils]: 31: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,015 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35224#true} {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #80#return; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,015 INFO L272 TraceCheckUtils]: 36: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,016 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35224#true} {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #82#return; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,018 INFO L272 TraceCheckUtils]: 44: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,019 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35224#true} {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #78#return; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,019 INFO L272 TraceCheckUtils]: 49: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,020 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35224#true} {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #80#return; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,020 INFO L272 TraceCheckUtils]: 54: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,021 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35224#true} {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #82#return; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,023 INFO L272 TraceCheckUtils]: 62: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,023 INFO L290 TraceCheckUtils]: 64: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,024 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35224#true} {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #78#return; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,024 INFO L272 TraceCheckUtils]: 67: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,024 INFO L290 TraceCheckUtils]: 68: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,024 INFO L290 TraceCheckUtils]: 69: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,025 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35224#true} {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #80#return; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,025 INFO L272 TraceCheckUtils]: 72: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,025 INFO L290 TraceCheckUtils]: 75: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,025 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35224#true} {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #82#return; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,028 INFO L290 TraceCheckUtils]: 79: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,028 INFO L272 TraceCheckUtils]: 80: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,029 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35224#true} {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #78#return; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,029 INFO L272 TraceCheckUtils]: 85: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,030 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35224#true} {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #80#return; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,030 INFO L272 TraceCheckUtils]: 90: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,030 INFO L290 TraceCheckUtils]: 91: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,030 INFO L290 TraceCheckUtils]: 92: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,030 INFO L290 TraceCheckUtils]: 93: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,031 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35224#true} {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #82#return; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,031 INFO L290 TraceCheckUtils]: 95: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,032 INFO L290 TraceCheckUtils]: 96: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,032 INFO L290 TraceCheckUtils]: 97: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,032 INFO L272 TraceCheckUtils]: 98: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,032 INFO L290 TraceCheckUtils]: 99: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,032 INFO L290 TraceCheckUtils]: 100: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,032 INFO L290 TraceCheckUtils]: 101: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,033 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35224#true} {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #84#return; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,033 INFO L272 TraceCheckUtils]: 103: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,033 INFO L290 TraceCheckUtils]: 104: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,033 INFO L290 TraceCheckUtils]: 105: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,033 INFO L290 TraceCheckUtils]: 106: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,034 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35224#true} {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} #86#return; {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,036 INFO L290 TraceCheckUtils]: 108: Hoare triple {35464#(and (<= main_~B~0 (div (div (div (div main_~d~0 2) 2) 2) 2)) (= main_~p~0 16) (= 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); {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,036 INFO L290 TraceCheckUtils]: 109: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,037 INFO L290 TraceCheckUtils]: 110: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,037 INFO L290 TraceCheckUtils]: 111: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,037 INFO L272 TraceCheckUtils]: 112: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,037 INFO L290 TraceCheckUtils]: 113: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,037 INFO L290 TraceCheckUtils]: 114: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,037 INFO L290 TraceCheckUtils]: 115: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,038 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35224#true} {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #84#return; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,038 INFO L272 TraceCheckUtils]: 117: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,038 INFO L290 TraceCheckUtils]: 118: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,038 INFO L290 TraceCheckUtils]: 119: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,038 INFO L290 TraceCheckUtils]: 120: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,039 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {35224#true} {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} #86#return; {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,040 INFO L290 TraceCheckUtils]: 122: Hoare triple {35409#(and (<= main_~B~0 (div (div (div main_~d~0 2) 2) 2)) (= main_~p~0 8) (= 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); {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,041 INFO L290 TraceCheckUtils]: 123: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,041 INFO L290 TraceCheckUtils]: 124: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,042 INFO L290 TraceCheckUtils]: 125: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} assume !!(#t~post6 < 10);havoc #t~post6; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,042 INFO L272 TraceCheckUtils]: 126: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,042 INFO L290 TraceCheckUtils]: 127: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,042 INFO L290 TraceCheckUtils]: 128: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,042 INFO L290 TraceCheckUtils]: 129: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,043 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {35224#true} {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #84#return; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,043 INFO L272 TraceCheckUtils]: 131: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,043 INFO L290 TraceCheckUtils]: 132: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,043 INFO L290 TraceCheckUtils]: 133: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,043 INFO L290 TraceCheckUtils]: 134: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,044 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {35224#true} {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} #86#return; {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} is VALID [2022-04-27 13:52:36,045 INFO L290 TraceCheckUtils]: 136: Hoare triple {35354#(and (= main_~B~0 1) (= main_~p~0 4) (<= main_~B~0 (div (div main_~d~0 2) 2)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,045 INFO L290 TraceCheckUtils]: 137: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,046 INFO L290 TraceCheckUtils]: 138: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,046 INFO L290 TraceCheckUtils]: 139: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,046 INFO L272 TraceCheckUtils]: 140: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,046 INFO L290 TraceCheckUtils]: 141: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,046 INFO L290 TraceCheckUtils]: 142: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,046 INFO L290 TraceCheckUtils]: 143: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,047 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35224#true} {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #84#return; {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} is VALID [2022-04-27 13:52:36,047 INFO L272 TraceCheckUtils]: 145: Hoare triple {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,047 INFO L290 TraceCheckUtils]: 146: Hoare triple {35224#true} ~cond := #in~cond; {35672#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:52:36,047 INFO L290 TraceCheckUtils]: 147: Hoare triple {35672#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:36,048 INFO L290 TraceCheckUtils]: 148: Hoare triple {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:52:36,048 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} {35299#(and (= main_~p~0 2) (<= main_~B~0 (div main_~d~0 2)) (= main_~B~0 1))} #86#return; {35683#(= main_~p~0 2)} is VALID [2022-04-27 13:52:36,049 INFO L290 TraceCheckUtils]: 150: Hoare triple {35683#(= 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); {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,049 INFO L290 TraceCheckUtils]: 151: Hoare triple {35687#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,049 INFO L290 TraceCheckUtils]: 152: Hoare triple {35687#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,049 INFO L290 TraceCheckUtils]: 153: Hoare triple {35687#(= main_~p~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,049 INFO L272 TraceCheckUtils]: 154: Hoare triple {35687#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 155: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 156: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 157: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {35224#true} {35687#(= main_~p~0 1)} #84#return; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,050 INFO L272 TraceCheckUtils]: 159: Hoare triple {35687#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 160: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 161: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:52:36,050 INFO L290 TraceCheckUtils]: 162: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:52:36,051 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {35224#true} {35687#(= main_~p~0 1)} #86#return; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 164: Hoare triple {35687#(= 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); {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 165: Hoare triple {35225#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 166: Hoare triple {35225#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 167: Hoare triple {35225#false} assume !(#t~post6 < 10);havoc #t~post6; {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L272 TraceCheckUtils]: 168: Hoare triple {35225#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 169: Hoare triple {35225#false} ~cond := #in~cond; {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 170: Hoare triple {35225#false} assume 0 == ~cond; {35225#false} is VALID [2022-04-27 13:52:36,051 INFO L290 TraceCheckUtils]: 171: Hoare triple {35225#false} assume !false; {35225#false} is VALID [2022-04-27 13:52:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 130 proven. 122 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2022-04-27 13:52:36,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:53:58,691 INFO L290 TraceCheckUtils]: 171: Hoare triple {35225#false} assume !false; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 170: Hoare triple {35225#false} assume 0 == ~cond; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 169: Hoare triple {35225#false} ~cond := #in~cond; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L272 TraceCheckUtils]: 168: Hoare triple {35225#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 167: Hoare triple {35225#false} assume !(#t~post6 < 10);havoc #t~post6; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 166: Hoare triple {35225#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 165: Hoare triple {35225#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35225#false} is VALID [2022-04-27 13:53:58,692 INFO L290 TraceCheckUtils]: 164: Hoare triple {35687#(= 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); {35225#false} is VALID [2022-04-27 13:53:58,693 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {35224#true} {35687#(= main_~p~0 1)} #86#return; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 162: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 161: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 160: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L272 TraceCheckUtils]: 159: Hoare triple {35687#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {35224#true} {35687#(= main_~p~0 1)} #84#return; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 157: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 156: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L290 TraceCheckUtils]: 155: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,693 INFO L272 TraceCheckUtils]: 154: Hoare triple {35687#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,694 INFO L290 TraceCheckUtils]: 153: Hoare triple {35687#(= main_~p~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,694 INFO L290 TraceCheckUtils]: 152: Hoare triple {35687#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,695 INFO L290 TraceCheckUtils]: 151: Hoare triple {35687#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,696 INFO L290 TraceCheckUtils]: 150: Hoare triple {35814#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35687#(= main_~p~0 1)} is VALID [2022-04-27 13:53:58,697 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} #86#return; {35814#(or (= (div main_~p~0 2) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,697 INFO L290 TraceCheckUtils]: 148: Hoare triple {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:53:58,697 INFO L290 TraceCheckUtils]: 147: Hoare triple {35828#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35676#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:53:58,698 INFO L290 TraceCheckUtils]: 146: Hoare triple {35224#true} ~cond := #in~cond; {35828#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:53:58,698 INFO L272 TraceCheckUtils]: 145: Hoare triple {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,698 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35224#true} {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} #84#return; {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,698 INFO L290 TraceCheckUtils]: 143: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,698 INFO L290 TraceCheckUtils]: 142: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,698 INFO L290 TraceCheckUtils]: 141: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,698 INFO L272 TraceCheckUtils]: 140: Hoare triple {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,699 INFO L290 TraceCheckUtils]: 139: Hoare triple {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,699 INFO L290 TraceCheckUtils]: 138: Hoare triple {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,699 INFO L290 TraceCheckUtils]: 137: Hoare triple {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~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; {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,706 INFO L290 TraceCheckUtils]: 136: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35818#(or (= (div main_~p~0 2) 1) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:53:58,707 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {35224#true} {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #86#return; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,707 INFO L290 TraceCheckUtils]: 134: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,707 INFO L290 TraceCheckUtils]: 133: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,707 INFO L290 TraceCheckUtils]: 132: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,707 INFO L272 TraceCheckUtils]: 131: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,708 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {35224#true} {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #84#return; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,708 INFO L290 TraceCheckUtils]: 129: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,708 INFO L290 TraceCheckUtils]: 128: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,708 INFO L290 TraceCheckUtils]: 127: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,708 INFO L272 TraceCheckUtils]: 126: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:53:58,709 INFO L290 TraceCheckUtils]: 125: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(#t~post6 < 10);havoc #t~post6; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,711 INFO L290 TraceCheckUtils]: 124: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,712 INFO L290 TraceCheckUtils]: 123: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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); {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:53:58,816 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {35224#true} {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #86#return; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:53:58,816 INFO L290 TraceCheckUtils]: 120: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,816 INFO L290 TraceCheckUtils]: 119: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,816 INFO L290 TraceCheckUtils]: 118: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,816 INFO L272 TraceCheckUtils]: 117: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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)); {35224#true} is VALID [2022-04-27 13:53:58,817 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35224#true} {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #84#return; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:53:58,817 INFO L290 TraceCheckUtils]: 115: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:53:58,817 INFO L290 TraceCheckUtils]: 114: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:53:58,817 INFO L290 TraceCheckUtils]: 113: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:53:58,817 INFO L272 TraceCheckUtils]: 112: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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)); {35224#true} is VALID [2022-04-27 13:53:58,820 INFO L290 TraceCheckUtils]: 111: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:53:58,822 INFO L290 TraceCheckUtils]: 110: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:53:58,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:00,829 WARN L290 TraceCheckUtils]: 108: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 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); {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is UNKNOWN [2022-04-27 13:54:00,830 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35224#true} {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #86#return; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,831 INFO L290 TraceCheckUtils]: 106: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:00,831 INFO L290 TraceCheckUtils]: 105: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:00,831 INFO L290 TraceCheckUtils]: 104: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:00,831 INFO L272 TraceCheckUtils]: 103: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:00,832 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35224#true} {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #84#return; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:00,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:00,832 INFO L290 TraceCheckUtils]: 99: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:00,832 INFO L272 TraceCheckUtils]: 98: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:00,836 INFO L290 TraceCheckUtils]: 97: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} assume !!(#t~post6 < 10);havoc #t~post6; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,839 INFO L290 TraceCheckUtils]: 96: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} assume !(~r~0 >= ~d~0); {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,843 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35224#true} {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #82#return; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:00,843 INFO L290 TraceCheckUtils]: 92: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:00,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:00,844 INFO L272 TraceCheckUtils]: 90: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:00,844 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35224#true} {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #80#return; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:00,844 INFO L290 TraceCheckUtils]: 87: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:00,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:00,845 INFO L272 TraceCheckUtils]: 85: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:00,845 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35224#true} {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #78#return; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:00,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:00,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:00,846 INFO L272 TraceCheckUtils]: 80: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:00,849 INFO L290 TraceCheckUtils]: 79: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} assume !!(#t~post5 < 10);havoc #t~post5; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:00,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:01,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35945#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (and (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1)))) (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)) (or (and (or (<= (+ (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) 1) 0) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (<= (* (div (+ (div (div main_~p~0 2) 2) 1) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1))) (not (= (mod (+ (div (div main_~p~0 2) 2) 1) 2) 0)))) (not (< (div main_~p~0 2) 0))) (or (and (or (and (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0 1) 0) (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0)))) (= (mod (div (div main_~p~0 2) 2) 2) 0) (not (< (div (div main_~p~0 2) 2) 0))) (or (and (<= (div (+ (- 1) (* (- 1) (div (div (div main_~p~0 2) 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div (div main_~p~0 2) 2) 2)) 2))) (and (or (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)) (not (= (mod main_~d~0 2) 0))) (or (<= (+ (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) 1) 0) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1))) (<= (* (div (div (div main_~p~0 2) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2))) (= (div (div (div main_~p~0 2) 2) 2) 1) (and (not (= (mod (div (div main_~p~0 2) 2) 2) 0)) (< (div (div main_~p~0 2) 2) 0)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (and (or (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (- (div (div main_~d~0 2) (- 2))) 2)) (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0)) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2)))) (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (or (not (= (mod (div (+ (div main_~p~0 2) 1) 2) 2) 0)) (and (or (not (= (mod main_~d~0 2) 0)) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (+ (- 1) (* (- 1) (div (* (- 1) (div main_~d~0 2)) 2))) 2))) (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (div (* (div (div main_~d~0 2) (- 2)) (- 1)) 2)) (or (<= (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* (div (div (+ (div main_~p~0 2) 1) 2) 2) main_~B~0) 1) 0)))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (and (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 3) (div main_~d~0 2)) 2)) 2) 1))) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2))) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0))) (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (or (not (= (mod (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2) 0)) (and (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (- 2) (div main_~d~0 2)) 2)) 2) 1)) (or (not (= (mod main_~d~0 2) 0)) (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 2) (div (+ 2 (* (- 1) (div main_~d~0 2))) (- 2))) 2) 1))) (or (<= (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) (+ (div (+ (- 1) (div (+ (div main_~d~0 2) (- 6)) 2)) 2) 1)) (<= (+ (* main_~B~0 (div (+ (div (+ (div main_~p~0 2) 1) 2) 1) 2)) 1) 0)))))))))} is VALID [2022-04-27 13:54:01,208 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35224#true} {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #82#return; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,208 INFO L272 TraceCheckUtils]: 72: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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)); {35224#true} is VALID [2022-04-27 13:54:01,209 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35224#true} {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #80#return; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,209 INFO L272 TraceCheckUtils]: 67: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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)); {35224#true} is VALID [2022-04-27 13:54:01,209 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35224#true} {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} #78#return; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,210 INFO L272 TraceCheckUtils]: 62: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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)); {35224#true} is VALID [2022-04-27 13:54:01,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post5 < 10);havoc #t~post5; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (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; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,256 INFO L290 TraceCheckUtils]: 59: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35902#(and (or (and (or (= (div (div main_~p~0 2) 2) 1) (and (or (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (+ (- 2) (div main_~d~0 2)) 2))) (or (not (= (mod main_~d~0 2) 0)) (<= (+ (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (div main_~d~0 2) 2))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (and (<= (div (+ (- 1) (* (- 1) (div (div main_~p~0 2) 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div (div main_~p~0 2) 2)) 2)))) (or (and (or (not (= (mod main_~d~0 2) 0)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) (div (* (- 1) (div main_~d~0 2)) (- 2)))) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (div main_~d~0 2) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (div main_~p~0 2) 2)) 1) 0))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 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) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (div main_~d~0 2) 2))) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (div main_~d~0 2) 2))) (not (< main_~d~0 0))) (or (and (or (and (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 1) (div main_~d~0 2)) 2)) (or (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2))) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ main_~B~0 (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (and (or (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 2) (div main_~d~0 2)) 2)) (<= (+ (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) 1) 0)) (<= (* main_~B~0 (div (+ (div main_~p~0 2) 1) 2)) (div (+ (- 1) (div main_~d~0 2)) 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-27 13:54:01,257 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35224#true} {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #82#return; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L272 TraceCheckUtils]: 54: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35224#true} {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #80#return; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,258 INFO L272 TraceCheckUtils]: 49: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,258 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35224#true} {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #78#return; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,258 INFO L272 TraceCheckUtils]: 44: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(#t~post5 < 10);havoc #t~post5; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35859#(and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))) (or (= (div main_~p~0 2) 1) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2))) (and (< (* main_~B~0 (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (or (not (<= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-27 13:54:01,266 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35224#true} {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} #82#return; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,266 INFO L272 TraceCheckUtils]: 36: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,267 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35224#true} {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} #80#return; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,267 INFO L272 TraceCheckUtils]: 31: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,268 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35224#true} {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} #78#return; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,268 INFO L272 TraceCheckUtils]: 26: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36147#(or (and (<= (div (+ (- 1) (* (- 1) main_~p~0)) (- 2)) 2) (<= 0 (div (+ (- 2) main_~p~0) 2))) (<= (+ (* main_~B~0 main_~p~0) 1) main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:54:01,272 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35224#true} {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} #82#return; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,272 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35224#true} {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} #80#return; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35224#true} {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} #78#return; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {35224#true} assume !(0 == ~cond); {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {35224#true} ~cond := #in~cond; {35224#true} is VALID [2022-04-27 13:54:01,273 INFO L272 TraceCheckUtils]: 8: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35224#true} is VALID [2022-04-27 13:54:01,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {35224#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; {36202#(or (<= (+ (* (* main_~B~0 main_~p~0) 2) 1) (* main_~d~0 2)) (and (<= 1 main_~p~0) (<= (div (+ (- 1) (* (- 2) main_~p~0)) (- 2)) 2)))} is VALID [2022-04-27 13:54:01,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {35224#true} call #t~ret7 := main(); {35224#true} is VALID [2022-04-27 13:54:01,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35224#true} {35224#true} #92#return; {35224#true} is VALID [2022-04-27 13:54:01,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-27 13:54:01,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {35224#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; {35224#true} is VALID [2022-04-27 13:54:01,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {35224#true} call ULTIMATE.init(); {35224#true} is VALID [2022-04-27 13:54:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 136 proven. 116 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2022-04-27 13:54:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:54:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903585699] [2022-04-27 13:54:01,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:54:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866054901] [2022-04-27 13:54:01,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866054901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:54:01,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:54:01,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2022-04-27 13:54:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036131637] [2022-04-27 13:54:01,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:54:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) Word has length 172 [2022-04-27 13:54:01,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:54:01,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) [2022-04-27 13:54:04,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 181 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:54:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 13:54:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:54:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 13:54:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:54:04,540 INFO L87 Difference]: Start difference. First operand 329 states and 361 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) [2022-04-27 13:54:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:54:12,065 INFO L93 Difference]: Finished difference Result 402 states and 456 transitions. [2022-04-27 13:54:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:54:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) Word has length 172 [2022-04-27 13:54:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:54:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) [2022-04-27 13:54:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-04-27 13:54:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) [2022-04-27 13:54:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-04-27 13:54:12,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2022-04-27 13:54:12,228 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:54:12,234 INFO L225 Difference]: With dead ends: 402 [2022-04-27 13:54:12,234 INFO L226 Difference]: Without dead ends: 301 [2022-04-27 13:54:12,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 321 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:54:12,235 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 26 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:54:12,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 495 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 13:54:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-27 13:54:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-04-27 13:54:12,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:54:12,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:54:12,491 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:54:12,492 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:54:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:54:12,497 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2022-04-27 13:54:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 327 transitions. [2022-04-27 13:54:12,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:54:12,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:54:12,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) Second operand 301 states. [2022-04-27 13:54:12,499 INFO L87 Difference]: Start difference. First operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) Second operand 301 states. [2022-04-27 13:54:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:54:12,505 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2022-04-27 13:54:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 327 transitions. [2022-04-27 13:54:12,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:54:12,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:54:12,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:54:12,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:54:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 202 states have (on average 1.0841584158415842) internal successors, (219), 207 states have internal predecessors, (219), 55 states have call successors, (55), 44 states have call predecessors, (55), 43 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-27 13:54:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 327 transitions. [2022-04-27 13:54:12,513 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 327 transitions. Word has length 172 [2022-04-27 13:54:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:54:12,513 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 327 transitions. [2022-04-27 13:54:12,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 17 states have internal predecessors, (82), 14 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (49), 15 states have call predecessors, (49), 13 states have call successors, (49) [2022-04-27 13:54:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 327 transitions. [2022-04-27 13:54:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-27 13:54:12,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:54:12,517 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:54:12,545 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 13:54:12,743 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 13:54:12,743 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:54:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:54:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1921551824, now seen corresponding path program 4 times [2022-04-27 13:54:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:54:12,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285352997] [2022-04-27 13:54:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:54:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:54:12,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:54:12,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756310956] [2022-04-27 13:54:12,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:54:12,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:54:12,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:54:12,764 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 13:54:12,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 13:54:12,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:54:12,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 13:54:12,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:54:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:54:12,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:54:12,983 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:54:12,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:54:13,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 13:54:13,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:54:13,203 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:54:13,206 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:54:13,280 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:54:13,281 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:54:13,282 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:54:13,283 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 13:54:13,283 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:54:13,283 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:54:13,283 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:54:13,283 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:54:13,283 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:54:13,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:54:13 BoogieIcfgContainer [2022-04-27 13:54:13,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:54:13,284 INFO L158 Benchmark]: Toolchain (without parser) took 781192.38ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 125.3MB in the beginning and 152.1MB in the end (delta: -26.7MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-04-27 13:54:13,284 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:54:13,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.67ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 125.1MB in the beginning and 227.0MB in the end (delta: -101.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-27 13:54:13,285 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 259.0MB. Free memory was 227.0MB in the beginning and 225.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:54:13,285 INFO L158 Benchmark]: RCFGBuilder took 362.71ms. Allocated memory is still 259.0MB. Free memory was 225.6MB in the beginning and 213.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:54:13,285 INFO L158 Benchmark]: TraceAbstraction took 780500.08ms. Allocated memory is still 259.0MB. Free memory was 212.5MB in the beginning and 152.1MB in the end (delta: 60.4MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. [2022-04-27 13:54:13,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.67ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 125.1MB in the beginning and 227.0MB in the end (delta: -101.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 259.0MB. Free memory was 227.0MB in the beginning and 225.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 362.71ms. Allocated memory is still 259.0MB. Free memory was 225.6MB in the beginning and 213.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 780500.08ms. Allocated memory is still 259.0MB. Free memory was 212.5MB in the beginning and 152.1MB in the end (delta: 60.4MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=13, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=31, B=1, counter=0, d=1, p=1, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=1, d=1, p=1, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=1, d=1, p=1, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=1, d=1, p=1, q=0, r=31] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=31, B=1, counter=1, d=2, p=2, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=2, d=2, p=2, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=2, d=2, p=2, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=2, d=2, p=2, q=0, r=31] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=31, B=1, counter=2, d=4, p=4, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=3, counter++=2, d=4, p=4, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=3, d=4, p=4, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=3, d=4, p=4, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=3, d=4, p=4, q=0, r=31] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=31, B=1, counter=3, d=8, p=8, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=4, counter++=3, d=8, p=8, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=4, d=8, p=8, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=4, d=8, p=8, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=4, d=8, p=8, q=0, r=31] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=31, B=1, counter=4, d=16, p=16, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=5, counter++=4, d=16, p=16, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=5, d=16, p=16, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=5, d=16, p=16, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=5, d=16, p=16, q=0, r=31] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=31, B=1, counter=5, d=32, p=32, q=0, r=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=6, counter++=5, d=32, p=32, q=0, r=31] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=31, B=1, counter=6, d=32, p=32, q=0, r=31] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=31, B=1, counter=6, d=32, p=32, q=0, r=31] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=31, B=1, counter=6, d=32, p=32, q=0, r=31] [L38] COND TRUE !(r >= d) VAL [\old(counter)=0, A=31, B=1, counter=6, d=32, p=32, q=0, r=31] [L44] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=7, counter++=6, d=32, p=32, q=0, r=31] [L44] COND TRUE counter++<10 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [\old(counter)=0, A=31, B=1, counter=7, d=32, p=32, q=0, r=31] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L46] RET __VERIFIER_assert(d == B*p) VAL [\old(counter)=0, A=31, B=1, counter=7, d=32, p=32, q=0, r=31] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [\old(counter)=0, A=31, B=1, counter=7, d=16, p=16, q=0, r=31] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [\old(counter)=0, A=31, B=1, counter=7, d=16, p=16, q=16, r=15] [L44] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=8, counter++=7, d=16, p=16, q=16, r=15] [L44] COND TRUE counter++<10 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [\old(counter)=0, A=31, B=1, counter=8, d=16, p=16, q=16, r=15] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L46] RET __VERIFIER_assert(d == B*p) VAL [\old(counter)=0, A=31, B=1, counter=8, d=16, p=16, q=16, r=15] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [\old(counter)=0, A=31, B=1, counter=8, d=8, p=8, q=16, r=15] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [\old(counter)=0, A=31, B=1, counter=8, d=8, p=8, q=24, r=7] [L44] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=9, counter++=8, d=8, p=8, q=24, r=7] [L44] COND TRUE counter++<10 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [\old(counter)=0, A=31, B=1, counter=9, d=8, p=8, q=24, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L46] RET __VERIFIER_assert(d == B*p) VAL [\old(counter)=0, A=31, B=1, counter=9, d=8, p=8, q=24, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [\old(counter)=0, A=31, B=1, counter=9, d=4, p=4, q=24, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [\old(counter)=0, A=31, B=1, counter=9, d=4, p=4, q=28, r=3] [L44] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=10, counter++=9, d=4, p=4, q=28, r=3] [L44] COND TRUE counter++<10 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [\old(counter)=0, A=31, B=1, counter=10, d=4, p=4, q=28, r=3] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L46] RET __VERIFIER_assert(d == B*p) VAL [\old(counter)=0, A=31, B=1, counter=10, d=4, p=4, q=28, r=3] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [\old(counter)=0, A=31, B=1, counter=10, d=2, p=2, q=28, r=3] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [\old(counter)=0, A=31, B=1, counter=10, d=2, p=2, q=30, r=1] [L44] EXPR counter++ VAL [\old(counter)=0, A=31, B=1, counter=11, counter++=10, d=2, p=2, q=30, r=1] [L44] COND FALSE !(counter++<10) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 780.4s, OverallIterations: 23, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 89.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 984 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 912 mSDsluCounter, 4243 SdHoareTripleChecker+Invalid, 26.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3169 mSDsCounter, 684 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4060 IncrementalHoareTripleChecker+Invalid, 4749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 684 mSolverCounterUnsat, 1074 mSDtfsCounter, 4060 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2913 GetRequests, 2665 SyntacticMatches, 29 SemanticMatches, 219 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=16, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 440 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 674.8s InterpolantComputationTime, 1790 NumberOfCodeBlocks, 1664 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2848 ConstructedInterpolants, 0 QuantifiedInterpolants, 40651 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3901 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 12686/14119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:54:13,511 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-27 13:54:13,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...