/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/hard2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:21:27,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:21:27,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:21:27,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:21:27,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:21:27,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:21:27,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:21:27,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:21:27,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:21:27,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:21:27,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:21:27,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:21:27,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:21:27,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:21:27,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:21:27,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:21:27,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:21:27,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:21:27,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:21:27,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:21:27,461 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:21:27,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:21:27,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:21:27,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:21:27,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:21:27,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:21:27,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:21:27,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:21:27,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:21:27,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:21:27,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:21:27,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:21:27,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:21:27,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:21:27,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:21:27,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:21:27,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:21:27,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:21:27,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:21:27,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:21:27,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:21:27,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:21:27,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:21:27,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:21:27,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:21:27,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:21:27,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:21:27,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:21:27,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:21:27,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:21:27,487 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:21:27,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:21:27,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:21:27,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:21:27,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:21:27,704 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:21:27,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-15 07:21:27,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b0c8159/9ed12ce98f444005826859420da2d135/FLAG814a5977d [2022-04-15 07:21:28,097 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:21:28,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-15 07:21:28,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b0c8159/9ed12ce98f444005826859420da2d135/FLAG814a5977d [2022-04-15 07:21:28,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b0c8159/9ed12ce98f444005826859420da2d135 [2022-04-15 07:21:28,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:21:28,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:21:28,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:21:28,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:21:28,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:21:28,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a5da1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28, skipping insertion in model container [2022-04-15 07:21:28,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:21:28,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:21:28,246 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/hard2.c[526,539] [2022-04-15 07:21:28,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:21:28,264 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:21:28,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c[526,539] [2022-04-15 07:21:28,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:21:28,283 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:21:28,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28 WrapperNode [2022-04-15 07:21:28,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:21:28,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:21:28,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:21:28,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:21:28,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:21:28,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:21:28,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:21:28,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:21:28,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (1/1) ... [2022-04-15 07:21:28,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:21:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:28,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:21:28,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:21:28,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:21:28,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:21:28,351 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:21:28,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:21:28,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:21:28,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:21:28,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:21:28,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:21:28,400 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:21:28,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:21:28,499 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:21:28,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:21:28,504 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:21:28,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:28 BoogieIcfgContainer [2022-04-15 07:21:28,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:21:28,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:21:28,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:21:28,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:21:28,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:21:28" (1/3) ... [2022-04-15 07:21:28,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211134e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:28, skipping insertion in model container [2022-04-15 07:21:28,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:28" (2/3) ... [2022-04-15 07:21:28,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211134e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:28, skipping insertion in model container [2022-04-15 07:21:28,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:28" (3/3) ... [2022-04-15 07:21:28,514 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2.c [2022-04-15 07:21:28,525 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:21:28,525 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:21:28,551 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:21:28,557 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:21:28,557 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:21:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 07:21:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 07:21:28,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:28,587 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:28,587 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 1 times [2022-04-15 07:21:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735753947] [2022-04-15 07:21:28,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 2 times [2022-04-15 07:21:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:28,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731092864] [2022-04-15 07:21:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:28,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#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); {32#true} is VALID [2022-04-15 07:21:28,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 07:21:28,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-15 07:21:28,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:28,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#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); {32#true} is VALID [2022-04-15 07:21:28,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 07:21:28,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-15 07:21:28,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-15 07:21:28,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {37#(= main_~q~0 0)} is VALID [2022-04-15 07:21:28,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~q~0 0)} assume !false; {37#(= main_~q~0 0)} is VALID [2022-04-15 07:21:28,820 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:28,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:21:28,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-15 07:21:28,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 07:21:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:21:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731092864] [2022-04-15 07:21:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731092864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:28,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:28,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:28,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:28,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735753947] [2022-04-15 07:21:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735753947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289498123] [2022-04-15 07:21:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 07:21:28,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:28,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:28,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:28,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:21:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:28,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:21:28,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:28,860 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:29,294 INFO L93 Difference]: Finished difference Result 66 states and 111 transitions. [2022-04-15 07:21:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:21:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 07:21:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 07:21:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-15 07:21:29,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-15 07:21:29,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:29,417 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:21:29,417 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:21:29,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:21:29,422 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:29,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:21:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:21:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-15 07:21:29,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:29,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,449 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,449 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:29,465 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:21:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:21:29,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:29,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:29,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 35 states. [2022-04-15 07:21:29,467 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 35 states. [2022-04-15 07:21:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:29,472 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 07:21:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 07:21:29,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:29,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:29,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:29,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 07:21:29,478 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2022-04-15 07:21:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:29,479 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 07:21:29,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:29,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 07:21:29,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 07:21:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 07:21:29,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:29,520 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:29,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:21:29,520 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 1 times [2022-04-15 07:21:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:29,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913467788] [2022-04-15 07:21:29,526 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 2 times [2022-04-15 07:21:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:29,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415158349] [2022-04-15 07:21:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:29,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#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); {309#true} is VALID [2022-04-15 07:21:29,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 07:21:29,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-15 07:21:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 07:21:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:29,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-15 07:21:29,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-15 07:21:29,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 07:21:29,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 07:21:29,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:29,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#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); {309#true} is VALID [2022-04-15 07:21:29,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 07:21:29,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-15 07:21:29,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2022-04-15 07:21:29,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#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; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 07:21:29,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(= main_~A~0 main_~r~0)} assume !false; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 07:21:29,636 INFO L272 TraceCheckUtils]: 7: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {309#true} is VALID [2022-04-15 07:21:29,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-15 07:21:29,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-15 07:21:29,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 07:21:29,637 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-15 07:21:29,637 INFO L272 TraceCheckUtils]: 12: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:29,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {320#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:21:29,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {310#false} is VALID [2022-04-15 07:21:29,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-15 07:21:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:21:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:29,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415158349] [2022-04-15 07:21:29,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415158349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:29,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:29,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:29,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913467788] [2022-04-15 07:21:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913467788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:29,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:29,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:29,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408771212] [2022-04-15 07:21:29,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-15 07:21:29,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:29,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:21:29,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:29,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:21:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:21:29,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:29,656 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:21:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:29,937 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-15 07:21:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:21:29,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-15 07:21:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:21:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:21:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:21:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:21:29,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 07:21:29,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:29,987 INFO L225 Difference]: With dead ends: 41 [2022-04-15 07:21:29,987 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 07:21:29,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:21:29,990 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:29,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:21:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 07:21:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-04-15 07:21:29,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:29,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,998 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:29,998 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:30,000 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 07:21:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-15 07:21:30,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:30,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:30,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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 39 states. [2022-04-15 07:21:30,001 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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 39 states. [2022-04-15 07:21:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:30,003 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 07:21:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-15 07:21:30,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:30,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:30,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:30,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 07:21:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-15 07:21:30,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2022-04-15 07:21:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:30,005 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-15 07:21:30,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:21:30,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-15 07:21:30,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-15 07:21:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:21:30,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:30,048 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:30,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:21:30,049 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 1 times [2022-04-15 07:21:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:30,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510820324] [2022-04-15 07:21:30,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 2 times [2022-04-15 07:21:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:30,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761545801] [2022-04-15 07:21:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:30,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:30,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591239286] [2022-04-15 07:21:30,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:30,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:30,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:21:30,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:21:30,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:30,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:30,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:21:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:30,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:30,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2022-04-15 07:21:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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); {556#true} is VALID [2022-04-15 07:21:30,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 07:21:30,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #90#return; {556#true} is VALID [2022-04-15 07:21:30,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret5 := main(); {556#true} is VALID [2022-04-15 07:21:30,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#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; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:30,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:30,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(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)); {556#true} is VALID [2022-04-15 07:21:30,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-15 07:21:30,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-15 07:21:30,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 07:21:30,270 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:30,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {576#(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)); {556#true} is VALID [2022-04-15 07:21:30,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-15 07:21:30,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-15 07:21:30,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-15 07:21:30,271 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:30,272 INFO L272 TraceCheckUtils]: 17: Hoare triple {576#(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)); {613#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:30,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {617#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:30,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {617#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {557#false} is VALID [2022-04-15 07:21:30,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-04-15 07:21:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:21:30,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:21:30,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:30,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761545801] [2022-04-15 07:21:30,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:30,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591239286] [2022-04-15 07:21:30,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591239286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:30,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:30,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:30,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:30,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510820324] [2022-04-15 07:21:30,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510820324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:30,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:30,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777794433] [2022-04-15 07:21:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 21 [2022-04-15 07:21:30,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:30,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:21:30,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:30,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:30,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:21:30,299 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:21:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:30,472 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-15 07:21:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 21 [2022-04-15 07:21:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:21:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 07:21:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:21:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 07:21:30,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 07:21:30,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:30,531 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:21:30,531 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 07:21:30,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:30,534 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:30,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:21:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 07:21:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 07:21:30,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:30,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:21:30,558 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:21:30,559 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:21:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:30,564 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 07:21:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 07:21:30,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:30,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:30,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 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 46 states. [2022-04-15 07:21:30,567 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 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 46 states. [2022-04-15 07:21:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:30,571 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 07:21:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 07:21:30,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:30,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:30,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:30,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:21:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-04-15 07:21:30,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2022-04-15 07:21:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:30,580 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-04-15 07:21:30,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:21:30,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 57 transitions. [2022-04-15 07:21:30,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 07:21:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 07:21:30,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:30,642 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:30,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 07:21:30,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:30,864 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 1 times [2022-04-15 07:21:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:30,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488998308] [2022-04-15 07:21:30,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 2 times [2022-04-15 07:21:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959221112] [2022-04-15 07:21:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:30,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:30,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417398670] [2022-04-15 07:21:30,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:30,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:21:30,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:21:30,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:30,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:30,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:21:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:30,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:31,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-15 07:21:31,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#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); {929#true} is VALID [2022-04-15 07:21:31,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 07:21:31,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #90#return; {929#true} is VALID [2022-04-15 07:21:31,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret5 := main(); {929#true} is VALID [2022-04-15 07:21:31,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#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; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,056 INFO L272 TraceCheckUtils]: 7: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {929#true} is VALID [2022-04-15 07:21:31,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 07:21:31,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 07:21:31,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 07:21:31,057 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #76#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,057 INFO L272 TraceCheckUtils]: 12: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {929#true} is VALID [2022-04-15 07:21:31,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 07:21:31,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 07:21:31,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 07:21:31,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,058 INFO L272 TraceCheckUtils]: 17: Hoare triple {949#(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)); {929#true} is VALID [2022-04-15 07:21:31,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-15 07:21:31,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-15 07:21:31,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-15 07:21:31,059 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:31,061 INFO L272 TraceCheckUtils]: 24: Hoare triple {949#(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)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:31,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:31,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-15 07:21:31,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-15 07:21:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 07:21:31,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:21:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959221112] [2022-04-15 07:21:31,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417398670] [2022-04-15 07:21:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417398670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:31,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:31,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488998308] [2022-04-15 07:21:31,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488998308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:31,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:31,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57640233] [2022-04-15 07:21:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:31,063 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 28 [2022-04-15 07:21:31,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:31,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:31,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:31,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:21:31,077 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:31,195 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-04-15 07:21:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:31,195 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 28 [2022-04-15 07:21:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 07:21:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-15 07:21:31,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-15 07:21:31,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:31,232 INFO L225 Difference]: With dead ends: 59 [2022-04-15 07:21:31,232 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:21:31,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:31,233 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:31,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:21:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:21:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-15 07:21:31,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:31,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:31,256 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:31,256 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:31,260 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-15 07:21:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-15 07:21:31,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:31,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:31,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 07:21:31,261 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 07:21:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:31,263 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-15 07:21:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-15 07:21:31,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:31,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:31,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:31,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-15 07:21:31,266 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-15 07:21:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:31,266 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-15 07:21:31,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:31,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-15 07:21:31,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 07:21:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 07:21:31,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:31,315 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:31,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 07:21:31,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 07:21:31,522 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 1 times [2022-04-15 07:21:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674222101] [2022-04-15 07:21:33,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:33,740 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:33,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 2 times [2022-04-15 07:21:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:33,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749361581] [2022-04-15 07:21:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:33,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:33,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336167000] [2022-04-15 07:21:33,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:33,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:33,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:33,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:21:33,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:21:33,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:33,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:33,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:21:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:33,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:34,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-15 07:21:34,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#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); {1343#true} is VALID [2022-04-15 07:21:34,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-15 07:21:34,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-15 07:21:34,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#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; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:34,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:34,014 INFO L272 TraceCheckUtils]: 7: Hoare triple {1363#(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)); {1343#true} is VALID [2022-04-15 07:21:34,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,015 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:34,016 INFO L272 TraceCheckUtils]: 12: Hoare triple {1363#(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)); {1343#true} is VALID [2022-04-15 07:21:34,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:34,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {1363#(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)); {1343#true} is VALID [2022-04-15 07:21:34,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,019 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:34,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {1363#(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; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 07:21:34,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !false; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 07:21:34,020 INFO L272 TraceCheckUtils]: 24: Hoare triple {1415#(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)); {1343#true} is VALID [2022-04-15 07:21:34,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,035 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #76#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 07:21:34,036 INFO L272 TraceCheckUtils]: 29: Hoare triple {1415#(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)); {1343#true} is VALID [2022-04-15 07:21:34,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,038 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-15 07:21:34,050 INFO L272 TraceCheckUtils]: 34: Hoare triple {1415#(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)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:34,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:34,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-15 07:21:34,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-15 07:21:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 07:21:34,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:21:34,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-15 07:21:34,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-15 07:21:34,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:34,205 INFO L272 TraceCheckUtils]: 34: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:34,205 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,206 INFO L272 TraceCheckUtils]: 29: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 07:21:34,207 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,208 INFO L272 TraceCheckUtils]: 24: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 07:21:34,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,216 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 07:21:34,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,217 INFO L272 TraceCheckUtils]: 12: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 07:21:34,218 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-15 07:21:34,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-15 07:21:34,218 INFO L272 TraceCheckUtils]: 7: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-15 07:21:34,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#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; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-15 07:21:34,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-15 07:21:34,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-15 07:21:34,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-15 07:21:34,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#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); {1343#true} is VALID [2022-04-15 07:21:34,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-15 07:21:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 07:21:34,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:34,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749361581] [2022-04-15 07:21:34,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:34,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336167000] [2022-04-15 07:21:34,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336167000] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:21:34,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:21:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 07:21:34,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:34,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674222101] [2022-04-15 07:21:34,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674222101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:34,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:34,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919856631] [2022-04-15 07:21:34,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:34,221 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, (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 38 [2022-04-15 07:21:34,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:34,223 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:34,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:34,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:21:34,239 INFO L87 Difference]: Start difference. First operand 51 states and 63 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:34,574 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-15 07:21:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:34,574 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, (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 38 [2022-04-15 07:21:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:34,575 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 07:21:34,576 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-15 07:21:34,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-15 07:21:34,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:34,623 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:21:34,623 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 07:21:34,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:21:34,624 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 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-15 07:21:34,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:21:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 07:21:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-04-15 07:21:34,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:34,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 07:21:34,651 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 07:21:34,651 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 07:21:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:34,654 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-15 07:21:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-15 07:21:34,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:34,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:34,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-15 07:21:34,655 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-15 07:21:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:34,657 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-15 07:21:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-15 07:21:34,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:34,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:34,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:34,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 07:21:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-15 07:21:34,660 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2022-04-15 07:21:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:34,661 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-15 07:21:34,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:34,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 71 transitions. [2022-04-15 07:21:34,745 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-15 07:21:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-15 07:21:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 07:21:34,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:34,746 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:34,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 07:21:34,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:34,962 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 1 times [2022-04-15 07:21:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587942927] [2022-04-15 07:21:36,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:36,172 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:36,172 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 2 times [2022-04-15 07:21:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:36,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195302077] [2022-04-15 07:21:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:36,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:36,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:36,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162448311] [2022-04-15 07:21:36,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:36,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:21:36,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:21:36,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:36,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:36,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 07:21:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:36,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:36,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 07:21:36,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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); {1943#true} is VALID [2022-04-15 07:21:36,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-15 07:21:36,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-15 07:21:36,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#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; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(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 !false; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,653 INFO L272 TraceCheckUtils]: 7: Hoare triple {1963#(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)); {1943#true} is VALID [2022-04-15 07:21:36,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,654 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {1963#(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))} #76#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {1963#(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)); {1943#true} is VALID [2022-04-15 07:21:36,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,656 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {1963#(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; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,656 INFO L272 TraceCheckUtils]: 17: Hoare triple {1963#(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)); {1943#true} is VALID [2022-04-15 07:21:36,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {1963#(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; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(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; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#(and (= main_~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 !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,659 INFO L272 TraceCheckUtils]: 24: Hoare triple {2015#(and (= main_~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)); {1943#true} is VALID [2022-04-15 07:21:36,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,660 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,660 INFO L272 TraceCheckUtils]: 29: Hoare triple {2015#(and (= main_~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)); {1943#true} is VALID [2022-04-15 07:21:36,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,660 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2015#(and (= main_~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; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,661 INFO L272 TraceCheckUtils]: 34: Hoare triple {2015#(and (= main_~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)); {1943#true} is VALID [2022-04-15 07:21:36,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,661 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2015#(and (= main_~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; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {2015#(and (= main_~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); {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {2015#(and (= main_~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 !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,662 INFO L272 TraceCheckUtils]: 41: Hoare triple {2015#(and (= main_~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)); {1943#true} is VALID [2022-04-15 07:21:36,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,663 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2015#(and (= main_~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; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,663 INFO L272 TraceCheckUtils]: 46: Hoare triple {2015#(and (= main_~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)); {1943#true} is VALID [2022-04-15 07:21:36,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:36,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:36,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:36,664 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2015#(and (= main_~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; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:21:36,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {2015#(and (= main_~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); {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:36,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {1963#(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; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-15 07:21:36,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !false; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-15 07:21:36,666 INFO L272 TraceCheckUtils]: 54: Hoare triple {2106#(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)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:36,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:36,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 07:21:36,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 07:21:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 07:21:36,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:21:37,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 07:21:37,645 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 07:21:37,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:37,646 INFO L272 TraceCheckUtils]: 54: Hoare triple {2133#(= (+ (* 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)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:37,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:21:37,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {2140#(= 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; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:21:37,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {2144#(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); {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,676 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2144#(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; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,676 INFO L272 TraceCheckUtils]: 46: Hoare triple {2144#(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)); {1943#true} is VALID [2022-04-15 07:21:37,677 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2144#(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; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,677 INFO L272 TraceCheckUtils]: 41: Hoare triple {2144#(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)); {1943#true} is VALID [2022-04-15 07:21:37,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {2144#(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 !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {2144#(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); {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,680 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2144#(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; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,681 INFO L272 TraceCheckUtils]: 34: Hoare triple {2144#(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)); {1943#true} is VALID [2022-04-15 07:21:37,686 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2144#(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; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,687 INFO L272 TraceCheckUtils]: 29: Hoare triple {2144#(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)); {1943#true} is VALID [2022-04-15 07:21:37,687 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2144#(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))))))))} #76#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,688 INFO L272 TraceCheckUtils]: 24: Hoare triple {2144#(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)); {1943#true} is VALID [2022-04-15 07:21:37,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {2144#(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 !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {2140#(= 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; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:21:37,699 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {2140#(= 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)); {1943#true} is VALID [2022-04-15 07:21:37,700 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,701 INFO L272 TraceCheckUtils]: 12: Hoare triple {2140#(= 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)); {1943#true} is VALID [2022-04-15 07:21:37,701 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #76#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-15 07:21:37,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-15 07:21:37,702 INFO L272 TraceCheckUtils]: 7: Hoare triple {2140#(= 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)); {1943#true} is VALID [2022-04-15 07:21:37,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !false; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#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; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:21:37,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-15 07:21:37,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-15 07:21:37,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 07:21:37,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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); {1943#true} is VALID [2022-04-15 07:21:37,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 07:21:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 07:21:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195302077] [2022-04-15 07:21:37,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162448311] [2022-04-15 07:21:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162448311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:21:37,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:21:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-15 07:21:37,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587942927] [2022-04-15 07:21:37,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587942927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:37,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:37,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:21:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902389743] [2022-04-15 07:21:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-15 07:21:37,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:37,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:21:37,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:37,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:21:37,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:21:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:21:37,740 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:21:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:38,298 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-04-15 07:21:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:21:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-15 07:21:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:21:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-15 07:21:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:21:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-15 07:21:38,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-15 07:21:38,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:38,399 INFO L225 Difference]: With dead ends: 124 [2022-04-15 07:21:38,400 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 07:21:38,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:21:38,401 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:38,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 142 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:21:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 07:21:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-04-15 07:21:38,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:38,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:21:38,444 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:21:38,444 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:21:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:38,448 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-15 07:21:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-15 07:21:38,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:38,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:38,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-15 07:21:38,450 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-15 07:21:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:38,454 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-15 07:21:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-15 07:21:38,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:38,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:38,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:38,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:21:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-04-15 07:21:38,458 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 58 [2022-04-15 07:21:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:38,459 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-04-15 07:21:38,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:21:38,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 111 transitions. [2022-04-15 07:21:38,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-04-15 07:21:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 07:21:38,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:38,576 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:38,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 07:21:38,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:38,785 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 3 times [2022-04-15 07:21:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:38,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132853808] [2022-04-15 07:21:42,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:42,913 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:42,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 4 times [2022-04-15 07:21:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290919141] [2022-04-15 07:21:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:42,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:42,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348322405] [2022-04-15 07:21:42,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:21:42,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:42,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:42,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:21:42,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 07:21:42,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:21:42,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:42,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 07:21:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:43,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:51,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {2926#true} call ULTIMATE.init(); {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#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); {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2926#true} {2926#true} #90#return; {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {2926#true} call #t~ret5 := main(); {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2926#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; {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {2926#true} assume !false; {2926#true} is VALID [2022-04-15 07:21:51,638 INFO L272 TraceCheckUtils]: 7: Hoare triple {2926#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:51,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,640 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2926#true} #76#return; {2966#(= main_~q~0 0)} is VALID [2022-04-15 07:21:51,640 INFO L272 TraceCheckUtils]: 12: Hoare triple {2966#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:51,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,641 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2966#(= main_~q~0 0)} #78#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:51,641 INFO L272 TraceCheckUtils]: 17: Hoare triple {2982#(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)); {2926#true} is VALID [2022-04-15 07:21:51,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-15 07:21:51,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-15 07:21:51,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,642 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2926#true} {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:51,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,644 INFO L272 TraceCheckUtils]: 24: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-15 07:21:51,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-15 07:21:51,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,644 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,644 INFO L272 TraceCheckUtils]: 29: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,645 INFO L272 TraceCheckUtils]: 34: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-15 07:21:51,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,646 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,647 INFO L272 TraceCheckUtils]: 41: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-15 07:21:51,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-15 07:21:51,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-15 07:21:51,648 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,648 INFO L272 TraceCheckUtils]: 46: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-15 07:21:51,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:51,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,650 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~0) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:21:51,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~0) 2) 0) (= main_~q~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); {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:51,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:21:51,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:21:51,653 INFO L272 TraceCheckUtils]: 54: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= 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)); {2926#true} is VALID [2022-04-15 07:21:51,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:51,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:51,658 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:21:51,658 INFO L272 TraceCheckUtils]: 59: Hoare triple {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:51,659 INFO L290 TraceCheckUtils]: 60: Hoare triple {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:51,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {3120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2927#false} is VALID [2022-04-15 07:21:51,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {2927#false} assume !false; {2927#false} is VALID [2022-04-15 07:21:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 07:21:51,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:22:14,886 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:22:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290919141] [2022-04-15 07:22:30,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:22:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348322405] [2022-04-15 07:22:30,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348322405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:22:30,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:22:30,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 07:22:30,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:30,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132853808] [2022-04-15 07:22:30,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132853808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:30,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:30,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:22:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620215473] [2022-04-15 07:22:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-15 07:22:30,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:30,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 07:22:30,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:30,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:22:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:22:30,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=218, Unknown=2, NotChecked=0, Total=272 [2022-04-15 07:22:30,266 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 07:22:32,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:22:34,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:22:36,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:22:38,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:22:44,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 07:22:46,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:22:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:47,095 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2022-04-15 07:22:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:22:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-15 07:22:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 07:22:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-15 07:22:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 07:22:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-15 07:22:47,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-15 07:22:47,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:47,167 INFO L225 Difference]: With dead ends: 117 [2022-04-15 07:22:47,167 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 07:22:47,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=81, Invalid=337, Unknown=2, NotChecked=0, Total=420 [2022-04-15 07:22:47,168 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:47,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 134 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 242 Invalid, 5 Unknown, 43 Unchecked, 11.9s Time] [2022-04-15 07:22:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 07:22:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-15 07:22:47,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:47,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:22:47,216 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:22:47,216 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:22:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:47,220 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-15 07:22:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-15 07:22:47,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:47,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:47,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-15 07:22:47,222 INFO L87 Difference]: Start difference. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-15 07:22:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:47,225 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-15 07:22:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-15 07:22:47,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:47,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:47,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:47,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:22:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-04-15 07:22:47,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 63 [2022-04-15 07:22:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:47,231 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-04-15 07:22:47,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 07:22:47,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 125 transitions. [2022-04-15 07:22:47,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-15 07:22:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 07:22:47,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:47,384 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:47,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 07:22:47,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:47,599 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:47,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 1 times [2022-04-15 07:22:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:47,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017184286] [2022-04-15 07:22:51,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:51,705 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:22:51,705 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:22:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 2 times [2022-04-15 07:22:51,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:51,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035819162] [2022-04-15 07:22:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:51,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:51,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:22:51,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950329735] [2022-04-15 07:22:51,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:22:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:22:51,715 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:22:51,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 07:22:51,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:22:51,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:22:51,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 07:22:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:51,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:22:52,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-15 07:22:52,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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); {3830#true} is VALID [2022-04-15 07:22:52,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-15 07:22:52,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-15 07:22:52,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#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; {3850#(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-15 07:22:52,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3850#(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 !false; {3850#(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-15 07:22:52,421 INFO L272 TraceCheckUtils]: 7: Hoare triple {3850#(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)); {3830#true} is VALID [2022-04-15 07:22:52,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,422 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3850#(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))} #76#return; {3850#(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-15 07:22:52,422 INFO L272 TraceCheckUtils]: 12: Hoare triple {3850#(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)); {3830#true} is VALID [2022-04-15 07:22:52,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,425 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3850#(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; {3850#(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-15 07:22:52,425 INFO L272 TraceCheckUtils]: 17: Hoare triple {3850#(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)); {3830#true} is VALID [2022-04-15 07:22:52,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,427 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3850#(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; {3850#(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-15 07:22:52,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(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; {3902#(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-15 07:22:52,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {3902#(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 !false; {3902#(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-15 07:22:52,428 INFO L272 TraceCheckUtils]: 24: Hoare triple {3902#(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)); {3830#true} is VALID [2022-04-15 07:22:52,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,430 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3902#(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))} #76#return; {3902#(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-15 07:22:52,430 INFO L272 TraceCheckUtils]: 29: Hoare triple {3902#(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)); {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3902#(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; {3902#(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-15 07:22:52,431 INFO L272 TraceCheckUtils]: 34: Hoare triple {3902#(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)); {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,437 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3902#(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; {3902#(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-15 07:22:52,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {3902#(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); {3902#(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-15 07:22:52,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {3902#(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 !false; {3902#(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-15 07:22:52,439 INFO L272 TraceCheckUtils]: 41: Hoare triple {3902#(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)); {3830#true} is VALID [2022-04-15 07:22:52,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,440 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3902#(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; {3902#(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-15 07:22:52,440 INFO L272 TraceCheckUtils]: 46: Hoare triple {3902#(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)); {3830#true} is VALID [2022-04-15 07:22:52,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:22:52,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:22:52,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:22:52,440 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3902#(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; {3902#(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-15 07:22:52,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {3902#(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); {3850#(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-15 07:22:52,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {3850#(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; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:52,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:52,442 INFO L272 TraceCheckUtils]: 54: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:22:52,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:52,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:52,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:52,444 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:52,444 INFO L272 TraceCheckUtils]: 59: Hoare triple {4014#(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)); {3830#true} is VALID [2022-04-15 07:22:52,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:52,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:52,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:52,446 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4014#(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))} #84#return; {4030#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-15 07:22:52,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {4030#(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); {4034#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-15 07:22:52,447 INFO L272 TraceCheckUtils]: 65: Hoare triple {4034#(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)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:52,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:52,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-15 07:22:52,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-15 07:22:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-15 07:22:52,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:23:03,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-15 07:23:03,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-15 07:23:03,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:03,413 INFO L272 TraceCheckUtils]: 65: Hoare triple {4058#(= (+ (* 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)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:23:03,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {4058#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:23:03,414 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4066#(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)))} #84#return; {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:03,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:03,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:23:03,415 INFO L272 TraceCheckUtils]: 59: Hoare triple {4066#(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)); {3830#true} is VALID [2022-04-15 07:23:03,417 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3830#true} #82#return; {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:23:03,418 INFO L272 TraceCheckUtils]: 54: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {3830#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {3830#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); {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3830#true} #84#return; {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L272 TraceCheckUtils]: 46: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3830#true} #82#return; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L272 TraceCheckUtils]: 41: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {3830#true} assume !(~r~0 >= ~d~0); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L272 TraceCheckUtils]: 34: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L272 TraceCheckUtils]: 29: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L272 TraceCheckUtils]: 24: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L272 TraceCheckUtils]: 17: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L272 TraceCheckUtils]: 7: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#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; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-15 07:23:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-15 07:23:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:23:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035819162] [2022-04-15 07:23:03,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:23:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950329735] [2022-04-15 07:23:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950329735] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:23:03,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:23:03,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-15 07:23:03,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:23:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2017184286] [2022-04-15 07:23:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2017184286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:23:03,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:23:03,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:23:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974431430] [2022-04-15 07:23:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:23:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:23:03,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:23:03,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:23:03,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:03,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:23:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:23:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:23:03,458 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:23:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,195 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-04-15 07:23:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:23:04,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:23:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:23:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:23:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-15 07:23:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:23:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-15 07:23:04,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2022-04-15 07:23:04,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:04,270 INFO L225 Difference]: With dead ends: 132 [2022-04-15 07:23:04,270 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 07:23:04,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:23:04,271 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:23:04,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:23:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 07:23:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 07:23:04,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:23:04,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:23:04,331 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:23:04,331 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:23:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,333 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 07:23:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 07:23:04,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:04,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:04,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-15 07:23:04,334 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-15 07:23:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,336 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-15 07:23:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 07:23:04,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:04,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:04,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:23:04,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:23:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 07:23:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-04-15 07:23:04,338 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 69 [2022-04-15 07:23:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:23:04,338 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-04-15 07:23:04,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:23:04,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 97 transitions. [2022-04-15 07:23:04,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-15 07:23:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 07:23:04,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:23:04,434 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:23:04,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 07:23:04,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:04,651 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:23:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:23:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 5 times [2022-04-15 07:23:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1761515189] [2022-04-15 07:23:07,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:23:07,448 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:23:07,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:23:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 6 times [2022-04-15 07:23:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:23:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341389769] [2022-04-15 07:23:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:23:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:23:07,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:23:07,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200732712] [2022-04-15 07:23:07,457 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:23:07,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:23:07,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:23:07,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 07:23:07,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:23:07,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:23:07,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:23:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:23:07,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:23:13,667 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:23:14,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {4859#true} call ULTIMATE.init(); {4859#true} is VALID [2022-04-15 07:23:14,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4859#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); {4859#true} is VALID [2022-04-15 07:23:14,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4859#true} {4859#true} #90#return; {4859#true} is VALID [2022-04-15 07:23:14,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {4859#true} call #t~ret5 := main(); {4859#true} is VALID [2022-04-15 07:23:14,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {4859#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; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,104 INFO L272 TraceCheckUtils]: 7: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,104 INFO L272 TraceCheckUtils]: 12: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,105 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,106 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,107 INFO L272 TraceCheckUtils]: 24: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,108 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,108 INFO L272 TraceCheckUtils]: 29: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,108 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,109 INFO L272 TraceCheckUtils]: 34: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,109 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,110 INFO L272 TraceCheckUtils]: 41: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,111 INFO L272 TraceCheckUtils]: 46: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,112 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,112 INFO L272 TraceCheckUtils]: 51: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {4859#true} ~cond := #in~cond; {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:14,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:14,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:23:14,114 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,115 INFO L272 TraceCheckUtils]: 58: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,116 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,116 INFO L272 TraceCheckUtils]: 63: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-15 07:23:14,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-15 07:23:14,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-15 07:23:14,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-15 07:23:14,117 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:23:14,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= 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); {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} is VALID [2022-04-15 07:23:14,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-15 07:23:14,121 INFO L290 TraceCheckUtils]: 70: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} assume !false; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-15 07:23:14,122 INFO L272 TraceCheckUtils]: 71: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:23:14,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:14,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {5088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4860#false} is VALID [2022-04-15 07:23:14,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {4860#false} assume !false; {4860#false} is VALID [2022-04-15 07:23:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-15 07:23:14,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:23:34,497 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:25:32,238 WARN L232 SmtUtils]: Spent 29.03s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:25:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341389769] [2022-04-15 07:25:32,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200732712] [2022-04-15 07:25:32,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200732712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:25:32,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:25:32,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 07:25:32,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1761515189] [2022-04-15 07:25:32,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1761515189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:32,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:32,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:25:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093837290] [2022-04-15 07:25:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-04-15 07:25:32,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:32,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 07:25:32,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:32,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:25:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:25:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:25:32,285 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 07:25:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,775 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-04-15 07:25:32,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:25:32,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-04-15 07:25:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 07:25:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-15 07:25:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 07:25:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-15 07:25:32,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-15 07:25:32,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:32,840 INFO L225 Difference]: With dead ends: 96 [2022-04-15 07:25:32,840 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 07:25:32,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:25:32,841 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:32,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-04-15 07:25:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 07:25:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-15 07:25:32,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:32,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:25:32,878 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:25:32,878 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:25:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,880 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-15 07:25:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-15 07:25:32,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:32,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:32,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-15 07:25:32,881 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-15 07:25:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:32,883 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-15 07:25:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-15 07:25:32,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:32,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:32,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:32,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 07:25:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-04-15 07:25:32,886 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 75 [2022-04-15 07:25:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:32,886 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-04-15 07:25:32,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 07:25:32,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 108 transitions. [2022-04-15 07:25:33,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-15 07:25:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 07:25:33,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:33,004 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:33,030 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-15 07:25:33,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:33,227 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 1 times [2022-04-15 07:25:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:33,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1560522157] [2022-04-15 07:25:36,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:25:36,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:25:36,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:25:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 2 times [2022-04-15 07:25:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110230035] [2022-04-15 07:25:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:36,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:36,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714644819] [2022-04-15 07:25:36,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:25:36,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:36,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:25:36,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 07:25:36,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:25:36,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:36,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:25:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:36,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:38,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {5730#true} call ULTIMATE.init(); {5730#true} is VALID [2022-04-15 07:25:38,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {5730#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); {5730#true} is VALID [2022-04-15 07:25:38,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5730#true} {5730#true} #90#return; {5730#true} is VALID [2022-04-15 07:25:38,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {5730#true} call #t~ret5 := main(); {5730#true} is VALID [2022-04-15 07:25:38,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {5730#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; {5750#(<= 1 main_~d~0)} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {5750#(<= 1 main_~d~0)} assume !false; {5750#(<= 1 main_~d~0)} is VALID [2022-04-15 07:25:38,665 INFO L272 TraceCheckUtils]: 7: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #76#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-15 07:25:38,665 INFO L272 TraceCheckUtils]: 12: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #78#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-15 07:25:38,666 INFO L272 TraceCheckUtils]: 17: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,666 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #80#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-15 07:25:38,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {5750#(<= 1 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-15 07:25:38,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !false; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-15 07:25:38,668 INFO L272 TraceCheckUtils]: 24: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #76#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-15 07:25:38,668 INFO L272 TraceCheckUtils]: 29: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,669 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #78#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-15 07:25:38,669 INFO L272 TraceCheckUtils]: 34: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,669 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #80#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-15 07:25:38,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,670 INFO L272 TraceCheckUtils]: 41: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #76#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,671 INFO L272 TraceCheckUtils]: 46: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,672 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #78#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,672 INFO L272 TraceCheckUtils]: 51: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,672 INFO L290 TraceCheckUtils]: 52: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,672 INFO L290 TraceCheckUtils]: 54: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,672 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #80#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,673 INFO L290 TraceCheckUtils]: 56: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !(~r~0 >= ~d~0); {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,673 INFO L272 TraceCheckUtils]: 58: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,674 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #82#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,674 INFO L272 TraceCheckUtils]: 63: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-15 07:25:38,674 INFO L290 TraceCheckUtils]: 64: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-15 07:25:38,674 INFO L290 TraceCheckUtils]: 65: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-15 07:25:38,674 INFO L290 TraceCheckUtils]: 66: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-15 07:25:38,674 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #84#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-15 07:25:38,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (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); {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} assume !(~r~0 >= ~d~0); {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L272 TraceCheckUtils]: 71: Hoare triple {5731#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 72: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 73: Hoare triple {5731#false} assume !(0 == ~cond); {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 74: Hoare triple {5731#false} assume true; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5731#false} {5731#false} #82#return; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L272 TraceCheckUtils]: 76: Hoare triple {5731#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 77: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 78: Hoare triple {5731#false} assume 0 == ~cond; {5731#false} is VALID [2022-04-15 07:25:38,676 INFO L290 TraceCheckUtils]: 79: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-15 07:25:38,677 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-15 07:25:38,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:25:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110230035] [2022-04-15 07:25:38,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:38,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714644819] [2022-04-15 07:25:38,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714644819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:38,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:38,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:25:38,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1560522157] [2022-04-15 07:25:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1560522157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:25:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801343189] [2022-04-15 07:25:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 80 [2022-04-15 07:25:38,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:38,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-15 07:25:38,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:38,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:25:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:25:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:25:38,718 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-15 07:25:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:39,197 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2022-04-15 07:25:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:25:39,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 80 [2022-04-15 07:25:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-15 07:25:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-15 07:25:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-15 07:25:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-15 07:25:39,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-15 07:25:39,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:39,269 INFO L225 Difference]: With dead ends: 122 [2022-04-15 07:25:39,269 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:25:39,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:25:39,275 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:39,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:25:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:25:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-04-15 07:25:39,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:39,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:39,343 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:39,343 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:39,345 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-15 07:25:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-15 07:25:39,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:39,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:39,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-15 07:25:39,346 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-15 07:25:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:39,347 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-15 07:25:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-15 07:25:39,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:39,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:39,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:39,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-04-15 07:25:39,349 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 80 [2022-04-15 07:25:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:39,349 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-04-15 07:25:39,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-15 07:25:39,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 90 transitions. [2022-04-15 07:25:39,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-15 07:25:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 07:25:39,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:39,447 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:39,480 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-15 07:25:39,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 07:25:39,661 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 3 times [2022-04-15 07:25:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:39,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620958545] [2022-04-15 07:25:42,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:25:42,070 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:25:42,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:25:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 4 times [2022-04-15 07:25:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:42,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963977368] [2022-04-15 07:25:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:42,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:42,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624671547] [2022-04-15 07:25:42,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:25:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:42,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:25:42,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 07:25:42,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:25:42,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:42,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:25:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:42,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:43,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-15 07:25:43,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#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); {6569#true} is VALID [2022-04-15 07:25:43,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#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; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,152 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-15 07:25:43,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,153 INFO L272 TraceCheckUtils]: 24: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #76#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,153 INFO L272 TraceCheckUtils]: 29: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,154 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #78#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,154 INFO L272 TraceCheckUtils]: 34: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,155 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #80#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,156 INFO L272 TraceCheckUtils]: 41: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,157 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #76#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,157 INFO L272 TraceCheckUtils]: 46: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,159 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,159 INFO L272 TraceCheckUtils]: 51: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,160 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,161 INFO L272 TraceCheckUtils]: 58: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,162 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,162 INFO L272 TraceCheckUtils]: 63: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,162 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,162 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:25:43,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,164 INFO L272 TraceCheckUtils]: 71: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,165 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #82#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,165 INFO L272 TraceCheckUtils]: 76: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,165 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,165 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #84#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:25:43,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-15 07:25:43,166 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-15 07:25:43,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-15 07:25:43,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-15 07:25:43,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-15 07:25:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 07:25:43,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:25:43,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-15 07:25:43,363 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-15 07:25:43,363 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-15 07:25:43,363 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-15 07:25:43,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {6843#(not (= main_~p~0 1))} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-15 07:25:43,364 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #84#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,364 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,364 INFO L272 TraceCheckUtils]: 76: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,365 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #82#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,365 INFO L272 TraceCheckUtils]: 71: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {6843#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,367 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #84#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,367 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,367 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,367 INFO L272 TraceCheckUtils]: 63: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,367 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #82#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,368 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,369 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #80#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L272 TraceCheckUtils]: 51: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #78#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,369 INFO L272 TraceCheckUtils]: 46: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,370 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #76#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,370 INFO L272 TraceCheckUtils]: 41: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {6843#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-15 07:25:43,371 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #80#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L272 TraceCheckUtils]: 34: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #78#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,372 INFO L272 TraceCheckUtils]: 29: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,373 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #76#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,373 INFO L272 TraceCheckUtils]: 24: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-15 07:25:43,374 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-15 07:25:43,374 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#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; {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#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); {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-15 07:25:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 07:25:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:25:43,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963977368] [2022-04-15 07:25:43,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:25:43,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624671547] [2022-04-15 07:25:43,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624671547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:25:43,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:25:43,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-15 07:25:43,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:25:43,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620958545] [2022-04-15 07:25:43,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620958545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:25:43,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:25:43,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:25:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558989698] [2022-04-15 07:25:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:25:43,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-15 07:25:43,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:25:43,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:25:43,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:43,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:25:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:25:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:25:43,416 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:25:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:43,580 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 07:25:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:25:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-15 07:25:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:25:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:25:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 07:25:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:25:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-15 07:25:43,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-15 07:25:43,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:43,645 INFO L225 Difference]: With dead ends: 91 [2022-04-15 07:25:43,646 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 07:25:43,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:25:43,646 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:25:43,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:25:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 07:25:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 07:25:43,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:25:43,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:43,719 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:43,719 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:43,720 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-15 07:25:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-15 07:25:43,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:43,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:43,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-15 07:25:43,721 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-15 07:25:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:25:43,722 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-15 07:25:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-15 07:25:43,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:25:43,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:25:43,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:25:43,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:25:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:25:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-15 07:25:43,724 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 86 [2022-04-15 07:25:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:25:43,724 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-15 07:25:43,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-15 07:25:43,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-15 07:25:43,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:25:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-15 07:25:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 07:25:43,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:25:43,886 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:25:43,902 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-15 07:25:44,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:44,092 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:25:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:25:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 7 times [2022-04-15 07:25:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:25:44,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446539860] [2022-04-15 07:25:48,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:25:48,170 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:25:48,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:25:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 8 times [2022-04-15 07:25:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:25:48,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876284096] [2022-04-15 07:25:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:25:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:25:48,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:25:48,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165876550] [2022-04-15 07:25:48,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:25:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:25:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:25:48,186 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:25:48,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 07:25:48,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:25:48,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:25:48,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 07:25:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:25:48,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:25:48,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-15 07:25:48,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#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); {7604#true} is VALID [2022-04-15 07:25:48,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-15 07:25:48,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-15 07:25:48,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#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; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:48,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {7624#(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 !false; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:48,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {7624#(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)); {7604#true} is VALID [2022-04-15 07:25:48,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,809 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {7624#(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))} #76#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:48,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {7624#(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)); {7604#true} is VALID [2022-04-15 07:25:48,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,809 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {7624#(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; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:48,809 INFO L272 TraceCheckUtils]: 17: Hoare triple {7624#(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)); {7604#true} is VALID [2022-04-15 07:25:48,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,810 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {7624#(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; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 07:25:48,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {7624#(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; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {7676#(and (= main_~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 !false; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,811 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#(and (= main_~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)); {7604#true} is VALID [2022-04-15 07:25:48,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,812 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,812 INFO L272 TraceCheckUtils]: 29: Hoare triple {7676#(and (= main_~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)); {7604#true} is VALID [2022-04-15 07:25:48,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,813 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7676#(and (= main_~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; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,813 INFO L272 TraceCheckUtils]: 34: Hoare triple {7676#(and (= main_~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)); {7604#true} is VALID [2022-04-15 07:25:48,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,814 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7676#(and (= main_~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; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {7676#(and (= main_~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; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {7728#(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 !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,827 INFO L272 TraceCheckUtils]: 41: Hoare triple {7728#(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)); {7604#true} is VALID [2022-04-15 07:25:48,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,829 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7728#(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))} #76#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,829 INFO L272 TraceCheckUtils]: 46: Hoare triple {7728#(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)); {7604#true} is VALID [2022-04-15 07:25:48,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,830 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7728#(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; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,830 INFO L272 TraceCheckUtils]: 51: Hoare triple {7728#(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)); {7604#true} is VALID [2022-04-15 07:25:48,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,830 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7728#(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; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {7728#(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); {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {7728#(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 !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,831 INFO L272 TraceCheckUtils]: 58: Hoare triple {7728#(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)); {7604#true} is VALID [2022-04-15 07:25:48,831 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,831 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,831 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,832 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7728#(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; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,832 INFO L272 TraceCheckUtils]: 63: Hoare triple {7728#(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)); {7604#true} is VALID [2022-04-15 07:25:48,832 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,832 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,832 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,833 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7728#(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; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-15 07:25:48,833 INFO L290 TraceCheckUtils]: 68: Hoare triple {7728#(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); {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,834 INFO L290 TraceCheckUtils]: 69: Hoare triple {7676#(and (= main_~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; {7819#(and (= main_~q~0 main_~p~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-15 07:25:48,834 INFO L290 TraceCheckUtils]: 70: Hoare triple {7819#(and (= main_~q~0 main_~p~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 !false; {7819#(and (= main_~q~0 main_~p~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-15 07:25:48,834 INFO L272 TraceCheckUtils]: 71: Hoare triple {7819#(and (= main_~q~0 main_~p~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)); {7604#true} is VALID [2022-04-15 07:25:48,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,835 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~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)))} #82#return; {7819#(and (= main_~q~0 main_~p~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-15 07:25:48,835 INFO L272 TraceCheckUtils]: 76: Hoare triple {7819#(and (= main_~q~0 main_~p~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)); {7604#true} is VALID [2022-04-15 07:25:48,835 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:25:48,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:25:48,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:25:48,836 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~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; {7819#(and (= main_~q~0 main_~p~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-15 07:25:48,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {7819#(and (= main_~q~0 main_~p~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); {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,838 INFO L290 TraceCheckUtils]: 83: Hoare triple {7860#(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 !false; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-15 07:25:48,838 INFO L272 TraceCheckUtils]: 84: Hoare triple {7860#(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)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:25:48,839 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:25:48,839 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-15 07:25:48,839 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-15 07:25:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 07:25:48,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:26:23,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-15 07:26:23,531 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-15 07:26:23,531 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:23,532 INFO L272 TraceCheckUtils]: 84: Hoare triple {7887#(= (+ (* 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)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:23,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:26:23,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {7894#(= 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; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:26:23,565 INFO L290 TraceCheckUtils]: 81: Hoare triple {7898#(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); {7894#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-15 07:26:23,566 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7898#(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; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:26:23,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,566 INFO L272 TraceCheckUtils]: 76: Hoare triple {7898#(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)); {7604#true} is VALID [2022-04-15 07:26:23,566 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7898#(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; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:26:23,566 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,567 INFO L272 TraceCheckUtils]: 71: Hoare triple {7898#(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)); {7604#true} is VALID [2022-04-15 07:26:23,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {7898#(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 !false; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:26:23,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-15 07:26:23,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:23,875 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,875 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,875 INFO L272 TraceCheckUtils]: 63: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:23,876 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,876 INFO L272 TraceCheckUtils]: 58: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:23,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,885 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,885 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,885 INFO L272 TraceCheckUtils]: 51: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:23,886 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,886 INFO L272 TraceCheckUtils]: 46: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:23,887 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #76#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:23,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:23,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:23,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:23,887 INFO L272 TraceCheckUtils]: 41: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:23,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:24,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 07:26:24,026 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:24,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,026 INFO L272 TraceCheckUtils]: 34: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:24,026 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L272 TraceCheckUtils]: 29: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #76#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,028 INFO L272 TraceCheckUtils]: 24: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-15 07:26:24,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !false; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:24,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {8078#(= (+ (* (* 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; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:24,052 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {8078#(= (+ (* (* 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; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-15 07:26:24,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {8078#(= (+ (* (* 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)); {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {8078#(= (+ (* (* 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; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {8078#(= (+ (* (* 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)); {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #76#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-15 07:26:24,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {8078#(= (+ (* (* 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)); {7604#true} is VALID [2022-04-15 07:26:24,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !false; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-15 07:26:24,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#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; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-15 07:26:24,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-15 07:26:24,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-15 07:26:24,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-15 07:26:24,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#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); {7604#true} is VALID [2022-04-15 07:26:24,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-15 07:26:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 19 refuted. 5 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 07:26:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876284096] [2022-04-15 07:26:24,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165876550] [2022-04-15 07:26:24,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165876550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:26:24,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:26:24,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-15 07:26:24,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446539860] [2022-04-15 07:26:24,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446539860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:24,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:24,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:26:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521372308] [2022-04-15 07:26:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:24,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-15 07:26:24,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:24,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:26:24,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:24,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:26:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:26:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2022-04-15 07:26:24,100 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:26:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:25,150 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2022-04-15 07:26:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:26:25,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-15 07:26:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:26:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-15 07:26:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:26:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-15 07:26:25,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2022-04-15 07:26:25,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:25,258 INFO L225 Difference]: With dead ends: 152 [2022-04-15 07:26:25,258 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 07:26:25,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=64, Invalid=206, Unknown=2, NotChecked=0, Total=272 [2022-04-15 07:26:25,259 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:25,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:26:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 07:26:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-15 07:26:25,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:25,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:25,355 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:25,355 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:25,359 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-15 07:26:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-15 07:26:25,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:25,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:25,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-15 07:26:25,360 INFO L87 Difference]: Start difference. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-15 07:26:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:25,364 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-15 07:26:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-15 07:26:25,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:25,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:25,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:25,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-04-15 07:26:25,367 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 88 [2022-04-15 07:26:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:25,368 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-04-15 07:26:25,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:26:25,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2022-04-15 07:26:25,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-04-15 07:26:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 07:26:25,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:25,602 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:25,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 07:26:25,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 07:26:25,803 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 9 times [2022-04-15 07:26:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:25,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153886522] [2022-04-15 07:26:27,477 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:26:27,478 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:26:27,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:26:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 10 times [2022-04-15 07:26:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:27,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730009857] [2022-04-15 07:26:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:27,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063761243] [2022-04-15 07:26:27,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:26:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:27,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:26:27,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 07:26:27,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:26:27,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:27,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 07:26:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:27,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:30,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {8981#true} call ULTIMATE.init(); {8981#true} is VALID [2022-04-15 07:26:30,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {8981#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); {8981#true} is VALID [2022-04-15 07:26:30,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8981#true} {8981#true} #90#return; {8981#true} is VALID [2022-04-15 07:26:30,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {8981#true} call #t~ret5 := main(); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {8981#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; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {8981#true} assume !false; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L272 TraceCheckUtils]: 7: Hoare triple {8981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8981#true} {8981#true} #76#return; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {8981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8981#true} {8981#true} #78#return; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L272 TraceCheckUtils]: 17: Hoare triple {8981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,221 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8981#true} {8981#true} #80#return; {8981#true} is VALID [2022-04-15 07:26:30,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {8981#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:26:30,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {9052#(= (mod main_~p~0 2) 0)} assume !false; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-15 07:26:30,222 INFO L272 TraceCheckUtils]: 24: Hoare triple {9052#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:30,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,224 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9052#(= (mod main_~p~0 2) 0)} #76#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,224 INFO L272 TraceCheckUtils]: 29: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,225 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,225 INFO L272 TraceCheckUtils]: 34: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,225 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,227 INFO L272 TraceCheckUtils]: 41: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,227 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8981#true} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,227 INFO L272 TraceCheckUtils]: 46: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:30,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,229 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,229 INFO L272 TraceCheckUtils]: 51: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,230 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,231 INFO L272 TraceCheckUtils]: 58: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,231 INFO L290 TraceCheckUtils]: 60: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,231 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,232 INFO L272 TraceCheckUtils]: 63: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,232 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:26:30,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~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); {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} is VALID [2022-04-15 07:26:30,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:26:30,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:26:30,235 INFO L272 TraceCheckUtils]: 71: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 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)); {8981#true} is VALID [2022-04-15 07:26:30,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-15 07:26:30,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-15 07:26:30,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-15 07:26:30,235 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {8981#true} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-15 07:26:30,236 INFO L272 TraceCheckUtils]: 76: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 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)); {8981#true} is VALID [2022-04-15 07:26:30,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:30,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,236 INFO L290 TraceCheckUtils]: 79: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,238 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)))} is VALID [2022-04-15 07:26:30,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (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); {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} is VALID [2022-04-15 07:26:30,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-15 07:26:30,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} assume !false; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-15 07:26:30,243 INFO L272 TraceCheckUtils]: 84: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-15 07:26:30,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:30,244 INFO L290 TraceCheckUtils]: 86: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,244 INFO L290 TraceCheckUtils]: 87: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:30,247 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} #82#return; {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} is VALID [2022-04-15 07:26:30,248 INFO L272 TraceCheckUtils]: 89: Hoare triple {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:30,248 INFO L290 TraceCheckUtils]: 90: Hoare triple {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:30,249 INFO L290 TraceCheckUtils]: 91: Hoare triple {9269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8982#false} is VALID [2022-04-15 07:26:30,249 INFO L290 TraceCheckUtils]: 92: Hoare triple {8982#false} assume !false; {8982#false} is VALID [2022-04-15 07:26:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-15 07:26:30,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:26:59,083 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:27:16,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:27:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730009857] [2022-04-15 07:27:16,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:27:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063761243] [2022-04-15 07:27:16,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063761243] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:27:16,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:27:16,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 07:27:16,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:27:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153886522] [2022-04-15 07:27:16,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153886522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:27:16,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:27:16,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:27:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392332782] [2022-04-15 07:27:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:27:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-15 07:27:16,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:27:16,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 07:27:16,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:16,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:27:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:16,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:27:16,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:27:16,136 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 07:27:27,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:29,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:30,760 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2022-04-15 07:27:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:27:30,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-15 07:27:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:27:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 07:27:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 07:27:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 07:27:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-15 07:27:30,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-15 07:27:30,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:30,843 INFO L225 Difference]: With dead ends: 150 [2022-04-15 07:27:30,843 INFO L226 Difference]: Without dead ends: 148 [2022-04-15 07:27:30,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:27:30,844 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:27:30,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 402 Invalid, 2 Unknown, 59 Unchecked, 5.0s Time] [2022-04-15 07:27:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-15 07:27:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-04-15 07:27:30,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:27:30,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 07:27:30,964 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 07:27:30,964 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 07:27:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:30,966 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-15 07:27:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-15 07:27:30,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:30,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:30,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-15 07:27:30,967 INFO L87 Difference]: Start difference. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-15 07:27:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:30,969 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-15 07:27:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-15 07:27:30,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:30,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:30,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:27:30,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:27:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 07:27:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2022-04-15 07:27:30,972 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 93 [2022-04-15 07:27:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:27:30,972 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2022-04-15 07:27:30,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 07:27:30,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 162 transitions. [2022-04-15 07:27:31,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2022-04-15 07:27:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 07:27:31,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:27:31,191 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:27:31,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 07:27:31,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 07:27:31,408 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:27:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:27:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 5 times [2022-04-15 07:27:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281138903] [2022-04-15 07:27:35,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:27:35,483 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:27:35,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:27:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 6 times [2022-04-15 07:27:35,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:27:35,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088964978] [2022-04-15 07:27:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:27:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:27:35,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:27:35,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113006111] [2022-04-15 07:27:35,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:27:35,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:27:35,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:27:35,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:27:35,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 07:27:35,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 07:27:35,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:27:35,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 07:27:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:27:35,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:27:35,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-15 07:27:35,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#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); {10211#true} is VALID [2022-04-15 07:27:35,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-15 07:27:35,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-15 07:27:35,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#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; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,795 INFO L272 TraceCheckUtils]: 12: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,795 INFO L272 TraceCheckUtils]: 17: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,796 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,797 INFO L272 TraceCheckUtils]: 29: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,797 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,798 INFO L272 TraceCheckUtils]: 34: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,798 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,799 INFO L272 TraceCheckUtils]: 41: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,799 INFO L272 TraceCheckUtils]: 46: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,800 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,800 INFO L272 TraceCheckUtils]: 51: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,800 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {10231#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,801 INFO L272 TraceCheckUtils]: 58: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,801 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,802 INFO L272 TraceCheckUtils]: 63: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,802 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,802 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {10231#(= 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); {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,803 INFO L272 TraceCheckUtils]: 71: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,803 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,803 INFO L272 TraceCheckUtils]: 76: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:35,804 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:35,804 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:35,804 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {10231#(= 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); {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-15 07:27:35,805 INFO L272 TraceCheckUtils]: 84: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:35,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:35,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:35,806 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:35,806 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10231#(= main_~B~0 1)} #82#return; {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-15 07:27:35,806 INFO L272 TraceCheckUtils]: 89: Hoare triple {10483#(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)); {10211#true} is VALID [2022-04-15 07:27:35,806 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:35,807 INFO L290 TraceCheckUtils]: 91: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:35,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:35,808 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #84#return; {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-15 07:27:35,808 INFO L290 TraceCheckUtils]: 94: Hoare triple {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-15 07:27:35,809 INFO L272 TraceCheckUtils]: 95: Hoare triple {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:35,809 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:35,809 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-15 07:27:35,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-15 07:27:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-15 07:27:35,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:27:48,694 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-15 07:27:48,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-15 07:27:48,695 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:48,695 INFO L272 TraceCheckUtils]: 95: Hoare triple {10527#(= (+ (* 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)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:48,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {10527#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:27:48,697 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #84#return; {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:27:48,698 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:48,698 INFO L290 TraceCheckUtils]: 91: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:48,698 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:27:48,698 INFO L272 TraceCheckUtils]: 89: Hoare triple {10535#(= (+ (* 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)); {10211#true} is VALID [2022-04-15 07:27:48,699 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10211#true} #82#return; {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-15 07:27:48,699 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:48,699 INFO L290 TraceCheckUtils]: 86: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:27:48,700 INFO L272 TraceCheckUtils]: 84: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 83: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 82: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 81: Hoare triple {10211#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); {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L272 TraceCheckUtils]: 76: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,700 INFO L272 TraceCheckUtils]: 71: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {10211#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); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L272 TraceCheckUtils]: 63: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L272 TraceCheckUtils]: 58: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {10211#true} assume !(~r~0 >= ~d~0); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L272 TraceCheckUtils]: 51: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L272 TraceCheckUtils]: 46: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L272 TraceCheckUtils]: 41: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L272 TraceCheckUtils]: 34: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,702 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L272 TraceCheckUtils]: 29: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L272 TraceCheckUtils]: 17: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-15 07:27:48,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L272 TraceCheckUtils]: 12: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L272 TraceCheckUtils]: 7: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#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; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#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); {10211#true} is VALID [2022-04-15 07:27:48,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-15 07:27:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-15 07:27:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:27:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088964978] [2022-04-15 07:27:48,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:27:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113006111] [2022-04-15 07:27:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113006111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:27:48,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:27:48,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-15 07:27:48,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:27:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281138903] [2022-04-15 07:27:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281138903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:27:48,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:27:48,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:27:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671785393] [2022-04-15 07:27:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:27:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 07:27:48,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:27:48,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 07:27:48,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:48,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:27:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:48,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:27:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:27:48,735 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 07:27:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:49,233 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2022-04-15 07:27:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:27:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 07:27:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:27:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 07:27:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:27:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 07:27:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 07:27:49,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 07:27:49,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:49,287 INFO L225 Difference]: With dead ends: 144 [2022-04-15 07:27:49,287 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:27:49,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:27:49,288 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:27:49,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:27:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:27:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:27:49,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:27:49,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:27:49,289 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:27:49,289 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:27:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:49,289 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:27:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:27:49,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:49,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:49,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:27:49,289 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:27:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:49,289 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:49,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:49,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:27:49,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:27:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:27:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-04-15 07:27:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:27:49,290 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 07:27:49,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:27:49,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:49,292 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:27:49,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 07:27:49,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 07:27:49,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:27:51,608 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 07:27:51,608 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 07:27:51,608 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 07:27:51,608 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-15 07:27:51,608 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-15 07:27:51,609 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-15 07:27:51,609 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-15 07:27:51,609 INFO L885 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-15 07:27:51,609 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 60) the Hoare annotation is: true [2022-04-15 07:27:51,609 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 60) the Hoare annotation is: true [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L36(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-15 07:27:51,609 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 60) the Hoare annotation is: true [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1)) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L51(lines 51 54) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,609 INFO L878 garLoopResultBuilder]: At program point L51-2(lines 22 60) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L45(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L43-1(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~d~0 1) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 07:27:51,610 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 07:27:51,610 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 07:27:51,612 INFO L719 BasicCegarLoop]: Path program histogram: [10, 6, 2, 2, 2, 2, 2, 2] [2022-04-15 07:27:51,613 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:27:51,615 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:27:51,616 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 07:27:51,617 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:27:51,617 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 07:27:51,617 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 07:27:51,621 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 07:27:51,638 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:27:51,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:27:51 BoogieIcfgContainer [2022-04-15 07:27:51,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:27:51,651 INFO L158 Benchmark]: Toolchain (without parser) took 383536.21ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 137.3MB in the beginning and 180.2MB in the end (delta: -42.8MB). Peak memory consumption was 111.1MB. Max. memory is 8.0GB. [2022-04-15 07:27:51,652 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:27:51,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.21ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 161.3MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:27:51,652 INFO L158 Benchmark]: Boogie Preprocessor took 18.22ms. Allocated memory is still 186.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:27:51,652 INFO L158 Benchmark]: RCFGBuilder took 198.52ms. Allocated memory is still 186.6MB. Free memory was 159.8MB in the beginning and 148.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:27:51,652 INFO L158 Benchmark]: TraceAbstraction took 383143.41ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 148.3MB in the beginning and 180.2MB in the end (delta: -31.9MB). Peak memory consumption was 122.1MB. Max. memory is 8.0GB. [2022-04-15 07:27:51,653 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 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.21ms. Allocated memory is still 186.6MB. Free memory was 137.1MB in the beginning and 161.3MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.22ms. Allocated memory is still 186.6MB. Free memory was 161.3MB in the beginning and 159.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 198.52ms. Allocated memory is still 186.6MB. Free memory was 159.8MB in the beginning and 148.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 383143.41ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 148.3MB in the beginning and 180.2MB in the end (delta: -31.9MB). Peak memory consumption was 122.1MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 383.1s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 37.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 1576 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 1112 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2335 IncrementalHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 464 mSDtfsCounter, 2335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1316 GetRequests, 1146 SyntacticMatches, 18 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 48.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=13, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 563 PreInvPairs, 795 NumberOfFragments, 582 HoareAnnotationTreeSize, 563 FomulaSimplifications, 1034 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 3734 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((q == 0 && B == 1) && B * q + r == A) && B == d) && p == 1) || (((((((B * p == d && d / 2 <= r) && -p / -2 % 2 == 0) && q == 0) && B == 1) && p % 2 == 0) && 1 <= d / 2 / 2) && B * q + r == A)) || ((((B * 2 == d && p == 2) && q == 0) && B == 1) && B * q + r == A) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:27:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...