/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/hard-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:21:11,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:21:11,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:21:11,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:21:11,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:21:11,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:21:11,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:21:11,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:21:11,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:21:11,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:21:11,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:21:11,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:21:11,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:21:11,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:21:11,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:21:11,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:21:11,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:21:11,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:21:11,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:21:11,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:21:11,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:21:11,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:21:11,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:21:11,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:21:11,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:21:11,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:21:11,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:21:11,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:21:11,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:21:11,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:21:11,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:21:11,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:21:11,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:21:11,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:21:11,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:21:11,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:21:11,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:21:11,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:21:11,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:21:11,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:21:11,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:21:11,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:21:11,333 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:11,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:21:11,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:21:11,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:21:11,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:21:11,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:21:11,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:21:11,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:21:11,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:21:11,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:21:11,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:21:11,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:21:11,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:21:11,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:21:11,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:21:11,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:21:11,345 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:21:11,345 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:21:11,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:21:11,345 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:21:11,345 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:11,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:21:11,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:21:11,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:21:11,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:21:11,562 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:21:11,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-ll.c [2022-04-15 07:21:11,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa403d18/51ebaaa19c66444091ed60f0df9de76e/FLAGf65cc1ef2 [2022-04-15 07:21:11,951 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:21:11,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-ll.c [2022-04-15 07:21:11,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa403d18/51ebaaa19c66444091ed60f0df9de76e/FLAGf65cc1ef2 [2022-04-15 07:21:11,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa403d18/51ebaaa19c66444091ed60f0df9de76e [2022-04-15 07:21:11,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:21:11,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:21:11,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:21:11,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:21:11,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:21:11,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:11" (1/1) ... [2022-04-15 07:21:11,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afda3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:11, skipping insertion in model container [2022-04-15 07:21:11,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:11" (1/1) ... [2022-04-15 07:21:11,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:21:11,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:21:12,108 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/hard-ll.c[538,551] [2022-04-15 07:21:12,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:21:12,139 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:21:12,147 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/hard-ll.c[538,551] [2022-04-15 07:21:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:21:12,163 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:21:12,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:12 WrapperNode [2022-04-15 07:21:12,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:21:12,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:21:12,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:21:12,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:21:12,172 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:12" (1/1) ... [2022-04-15 07:21:12,173 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:12" (1/1) ... [2022-04-15 07:21:12,179 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:12" (1/1) ... [2022-04-15 07:21:12,179 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:12" (1/1) ... [2022-04-15 07:21:12,191 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:12" (1/1) ... [2022-04-15 07:21:12,197 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:12" (1/1) ... [2022-04-15 07:21:12,201 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:12" (1/1) ... [2022-04-15 07:21:12,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:21:12,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:21:12,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:21:12,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:21:12,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:12" (1/1) ... [2022-04-15 07:21:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:21:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:12,237 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:12,254 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:12,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:21:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:21:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:21:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:21:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:21:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:21:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:21:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:21:12,273 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:21:12,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:21:12,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 07:21:12,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:21:12,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:21:12,321 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:21:12,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:21:12,462 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:21:12,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:21:12,467 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 07:21:12,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:12 BoogieIcfgContainer [2022-04-15 07:21:12,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:21:12,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:21:12,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:21:12,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:21:12,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:21:11" (1/3) ... [2022-04-15 07:21:12,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6931e198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:12, skipping insertion in model container [2022-04-15 07:21:12,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:12" (2/3) ... [2022-04-15 07:21:12,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6931e198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:12, skipping insertion in model container [2022-04-15 07:21:12,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:12" (3/3) ... [2022-04-15 07:21:12,480 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll.c [2022-04-15 07:21:12,483 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:21:12,483 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:21:12,511 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:21:12,515 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:12,516 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:21:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 07:21:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:21:12,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:12,533 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:12,534 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:12,537 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-15 07:21:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062858135] [2022-04-15 07:21:12,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 2 times [2022-04-15 07:21:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:12,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76348859] [2022-04-15 07:21:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:12,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(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(10, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-15 07:21:12,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 07:21:12,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-15 07:21:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:21:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:12,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-15 07:21:12,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-15 07:21:12,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-15 07:21:12,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-15 07:21:12,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:12,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(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(10, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-15 07:21:12,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 07:21:12,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-15 07:21:12,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-15 07:21:12,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-15 07:21:12,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-15 07:21:12,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-15 07:21:12,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-15 07:21:12,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-15 07:21:12,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-15 07:21:12,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {39#false} is VALID [2022-04-15 07:21:12,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 07:21:12,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {39#false} is VALID [2022-04-15 07:21:12,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-15 07:21:12,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-15 07:21:12,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 07:21:12,705 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:12,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76348859] [2022-04-15 07:21:12,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76348859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:12,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:12,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:21:12,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:12,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062858135] [2022-04-15 07:21:12,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062858135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:12,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:12,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:21:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432036109] [2022-04-15 07:21:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:21:12,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:12,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:12,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:12,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:21:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:12,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:21:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:21:12,751 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:12,929 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-15 07:21:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:21:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:21:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 07:21:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 07:21:12,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 07:21:13,077 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:21:13,083 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:21:13,083 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 07:21:13,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:21:13,087 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:13,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:21:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 07:21:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 07:21:13,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:13,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,110 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,110 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:13,115 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 07:21:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 07:21:13,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:13,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:13,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-15 07:21:13,116 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-15 07:21:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:13,120 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-15 07:21:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 07:21:13,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:13,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:13,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:13,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-15 07:21:13,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-15 07:21:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:13,124 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-15 07:21:13,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-15 07:21:13,158 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:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-15 07:21:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:21:13,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:13,159 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:13,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:21:13,159 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-15 07:21:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631127218] [2022-04-15 07:21:13,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 2 times [2022-04-15 07:21:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:13,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423527208] [2022-04-15 07:21:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(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(10, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-15 07:21:13,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:21:13,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-15 07:21:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:21:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-15 07:21:13,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-15 07:21:13,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:21:13,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-15 07:21:13,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:13,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#(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(10, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-15 07:21:13,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:21:13,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-15 07:21:13,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret6 := main(); {292#true} is VALID [2022-04-15 07:21:13,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {292#true} is VALID [2022-04-15 07:21:13,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {292#true} is VALID [2022-04-15 07:21:13,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-15 07:21:13,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-15 07:21:13,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:21:13,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-15 07:21:13,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {301#(= main_~q~0 0)} is VALID [2022-04-15 07:21:13,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(= main_~q~0 0)} assume !false; {301#(= main_~q~0 0)} is VALID [2022-04-15 07:21:13,233 INFO L272 TraceCheckUtils]: 13: Hoare triple {301#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:13,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {303#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:21:13,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {293#false} is VALID [2022-04-15 07:21:13,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-15 07:21:13,234 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:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:13,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423527208] [2022-04-15 07:21:13,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423527208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:13,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:13,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:13,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631127218] [2022-04-15 07:21:13,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631127218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:13,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275924715] [2022-04-15 07:21:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:21:13,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:13,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:13,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:21:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:21:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:13,249 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:13,615 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-15 07:21:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:21:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:21:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 07:21:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 07:21:13,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-15 07:21:13,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:13,691 INFO L225 Difference]: With dead ends: 43 [2022-04-15 07:21:13,691 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 07:21:13,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:13,694 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:13,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:21:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 07:21:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-15 07:21:13,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:13,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,708 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,710 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:13,715 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 07:21:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 07:21:13,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:13,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:13,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-15 07:21:13,725 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-15 07:21:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:13,730 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 07:21:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 07:21:13,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:13,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:13,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:13,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-15 07:21:13,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-15 07:21:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:13,733 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-15 07:21:13,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:21:13,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-15 07:21:13,776 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:21:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 07:21:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 07:21:13,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:13,778 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:13,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:21:13,780 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-15 07:21:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:13,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [20195426] [2022-04-15 07:21:13,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 2 times [2022-04-15 07:21:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:13,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246414675] [2022-04-15 07:21:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#(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(10, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-15 07:21:13,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-15 07:21:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:21:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-15 07:21:13,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-15 07:21:13,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-15 07:21:13,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 07:21:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:13,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-15 07:21:13,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-15 07:21:13,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #80#return; {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 07:21:13,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:13,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(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(10, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-15 07:21:13,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-15 07:21:13,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret6 := main(); {551#true} is VALID [2022-04-15 07:21:13,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {551#true} is VALID [2022-04-15 07:21:13,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {551#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {551#true} is VALID [2022-04-15 07:21:13,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-15 07:21:13,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-15 07:21:13,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-15 07:21:13,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 07:21:13,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !false; {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 07:21:13,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {551#true} is VALID [2022-04-15 07:21:13,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-15 07:21:13,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-15 07:21:13,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-15 07:21:13,919 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {551#true} {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #80#return; {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 07:21:13,920 INFO L272 TraceCheckUtils]: 18: Hoare triple {560#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:13,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {566#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:21:13,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-15 07:21:13,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-15 07:21:13,922 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:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246414675] [2022-04-15 07:21:13,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246414675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:13,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:13,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:13,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [20195426] [2022-04-15 07:21:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [20195426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:13,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:13,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:21:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168243384] [2022-04-15 07:21:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:13,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 07:21:13,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:13,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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:13,938 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:13,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:21:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:13,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:21:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:21:13,940 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,291 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 07:21:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:21:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 07:21:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 07:21:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-15 07:21:14,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-15 07:21:14,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:14,374 INFO L225 Difference]: With dead ends: 47 [2022-04-15 07:21:14,374 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:21:14,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:14,375 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:14,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:21:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:21:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-15 07:21:14,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:14,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:14,395 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:14,396 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,402 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 07:21:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 07:21:14,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:14,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:14,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 07:21:14,403 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 07:21:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,407 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 07:21:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 07:21:14,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:14,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:14,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:14,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:21:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-15 07:21:14,410 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-15 07:21:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:14,410 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-15 07:21:14,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 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:14,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 44 transitions. [2022-04-15 07:21:14,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-15 07:21:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 07:21:14,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:14,445 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:14,445 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:21:14,446 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-15 07:21:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:14,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472905649] [2022-04-15 07:21:14,451 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 2 times [2022-04-15 07:21:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:14,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496711326] [2022-04-15 07:21:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:14,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:14,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579015171] [2022-04-15 07:21:14,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:14,482 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:14,489 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:14,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:14,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:14,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:21:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:14,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:14,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {838#true} call ULTIMATE.init(); {838#true} is VALID [2022-04-15 07:21:14,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#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(10, 2);call #Ultimate.allocInit(12, 3); {838#true} is VALID [2022-04-15 07:21:14,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-15 07:21:14,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {838#true} {838#true} #94#return; {838#true} is VALID [2022-04-15 07:21:14,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {838#true} call #t~ret6 := main(); {838#true} is VALID [2022-04-15 07:21:14,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {838#true} is VALID [2022-04-15 07:21:14,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {838#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {838#true} is VALID [2022-04-15 07:21:14,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-15 07:21:14,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-15 07:21:14,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-15 07:21:14,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#true} {838#true} #78#return; {838#true} is VALID [2022-04-15 07:21:14,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:14,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:14,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {838#true} is VALID [2022-04-15 07:21:14,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-15 07:21:14,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-15 07:21:14,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-15 07:21:14,735 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {838#true} {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #80#return; {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:14,735 INFO L272 TraceCheckUtils]: 18: Hoare triple {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {838#true} is VALID [2022-04-15 07:21:14,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-15 07:21:14,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-15 07:21:14,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-15 07:21:14,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {838#true} {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:14,738 INFO L272 TraceCheckUtils]: 23: Hoare triple {876#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:14,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:14,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {839#false} is VALID [2022-04-15 07:21:14,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-04-15 07:21:14,739 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:14,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:21:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496711326] [2022-04-15 07:21:14,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579015171] [2022-04-15 07:21:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579015171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:14,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:14,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472905649] [2022-04-15 07:21:14,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472905649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:14,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:14,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806631006] [2022-04-15 07:21:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:14,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 07:21:14,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:14,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:14,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:14,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:14,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:21:14,758 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,957 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-15 07:21:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:14,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 07:21:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 07:21:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 07:21:14,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-15 07:21:15,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:15,029 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:21:15,029 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:21:15,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:15,030 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:15,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:21:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:21:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 07:21:15,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:15,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:15,041 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:15,041 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:15,043 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 07:21:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 07:21:15,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:15,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:15,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 07:21:15,044 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-15 07:21:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:15,045 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 07:21:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 07:21:15,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:15,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:15,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:15,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 07:21:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-15 07:21:15,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2022-04-15 07:21:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:15,047 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-15 07:21:15,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:21:15,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 63 transitions. [2022-04-15 07:21:15,116 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:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 07:21:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:21:15,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:15,117 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:15,141 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:15,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:15,333 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-15 07:21:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:15,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900174882] [2022-04-15 07:21:15,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:21:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 2 times [2022-04-15 07:21:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:15,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002556325] [2022-04-15 07:21:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:15,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:15,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612906409] [2022-04-15 07:21:15,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:15,358 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:15,359 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:15,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:15,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:15,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:21:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:15,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:15,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#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(10, 2);call #Ultimate.allocInit(12, 3); {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1265#true} assume true; {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1265#true} {1265#true} #94#return; {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {1265#true} call #t~ret6 := main(); {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {1265#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {1265#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#true} ~cond := #in~cond; {1265#true} is VALID [2022-04-15 07:21:15,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#true} assume !(0 == ~cond); {1265#true} is VALID [2022-04-15 07:21:15,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#true} assume true; {1265#true} is VALID [2022-04-15 07:21:15,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1265#true} {1265#true} #78#return; {1265#true} is VALID [2022-04-15 07:21:15,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {1265#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1265#true} is VALID [2022-04-15 07:21:15,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#true} ~cond := #in~cond; {1265#true} is VALID [2022-04-15 07:21:15,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#true} assume !(0 == ~cond); {1265#true} is VALID [2022-04-15 07:21:15,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#true} assume true; {1265#true} is VALID [2022-04-15 07:21:15,540 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1265#true} {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1265#true} is VALID [2022-04-15 07:21:15,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {1265#true} ~cond := #in~cond; {1265#true} is VALID [2022-04-15 07:21:15,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#true} assume !(0 == ~cond); {1265#true} is VALID [2022-04-15 07:21:15,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#true} assume true; {1265#true} is VALID [2022-04-15 07:21:15,541 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1265#true} {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,541 INFO L272 TraceCheckUtils]: 23: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1265#true} is VALID [2022-04-15 07:21:15,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {1265#true} ~cond := #in~cond; {1265#true} is VALID [2022-04-15 07:21:15,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#true} assume !(0 == ~cond); {1265#true} is VALID [2022-04-15 07:21:15,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {1265#true} assume true; {1265#true} is VALID [2022-04-15 07:21:15,542 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1265#true} {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:21:15,543 INFO L272 TraceCheckUtils]: 30: Hoare triple {1303#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {1361#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:15,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {1361#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1365#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:15,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {1365#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1266#false} is VALID [2022-04-15 07:21:15,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2022-04-15 07:21:15,544 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:15,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:21:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002556325] [2022-04-15 07:21:15,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612906409] [2022-04-15 07:21:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612906409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:15,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:15,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900174882] [2022-04-15 07:21:15,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900174882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:15,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:15,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324048209] [2022-04-15 07:21:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 07:21:15,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:15,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:15,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:15,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:21:15,564 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:15,721 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-15 07:21:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 07:21:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 07:21:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 07:21:15,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-15 07:21:15,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:15,764 INFO L225 Difference]: With dead ends: 65 [2022-04-15 07:21:15,765 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 07:21:15,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:15,765 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:15,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 104 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:21:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 07:21:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-04-15 07:21:15,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:15,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:21:15,795 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:21:15,796 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:21:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:15,798 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 07:21:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 07:21:15,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:15,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:15,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-15 07:21:15,801 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-15 07:21:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:15,802 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 07:21:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 07:21:15,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:15,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:15,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:15,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:21:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-15 07:21:15,805 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 34 [2022-04-15 07:21:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:15,805 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-15 07:21:15,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:15,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 69 transitions. [2022-04-15 07:21:15,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-15 07:21:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:21:15,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:15,885 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:15,909 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:16,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:16,086 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:16,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-15 07:21:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1979673585] [2022-04-15 07:21:21,916 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:21,917 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:21,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 2 times [2022-04-15 07:21:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:21,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531536746] [2022-04-15 07:21:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:21,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:21,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235103171] [2022-04-15 07:21:21,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:21,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:21,940 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:21,979 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:22,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:22,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:22,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 07:21:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:22,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:22,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1733#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(10, 2);call #Ultimate.allocInit(12, 3); {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #94#return; {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret6 := main(); {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1733#true} is VALID [2022-04-15 07:21:22,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#true} ~cond := #in~cond; {1759#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:21:22,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1763#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:21:22,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1763#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1763#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:21:22,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1763#(not (= |assume_abort_if_not_#in~cond| 0))} {1733#true} #78#return; {1770#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 07:21:22,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {1770#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:22,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:22,845 INFO L272 TraceCheckUtils]: 13: Hoare triple {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:22,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:22,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,846 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1733#true} {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #80#return; {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:22,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:22,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:22,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,846 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1733#true} {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:22,847 INFO L272 TraceCheckUtils]: 23: Hoare triple {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:22,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:22,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,847 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1733#true} {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:22,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:22,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !false; {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:22,849 INFO L272 TraceCheckUtils]: 30: Hoare triple {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:22,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:22,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,850 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1733#true} {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #80#return; {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:22,850 INFO L272 TraceCheckUtils]: 35: Hoare triple {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:22,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:22,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:22,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:22,851 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1733#true} {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:22,853 INFO L272 TraceCheckUtils]: 40: Hoare triple {1826#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:22,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {1863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:22,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1734#false} is VALID [2022-04-15 07:21:22,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2022-04-15 07:21:22,854 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:22,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:21:23,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {1734#false} assume !false; {1734#false} is VALID [2022-04-15 07:21:23,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1734#false} is VALID [2022-04-15 07:21:23,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {1863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:23,160 INFO L272 TraceCheckUtils]: 40: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:23,160 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1733#true} {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,161 INFO L272 TraceCheckUtils]: 35: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,162 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1733#true} {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #80#return; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,162 INFO L272 TraceCheckUtils]: 30: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,164 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1733#true} {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,165 INFO L272 TraceCheckUtils]: 23: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,165 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1733#true} {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,166 INFO L272 TraceCheckUtils]: 18: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,166 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1733#true} {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #80#return; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,166 INFO L272 TraceCheckUtils]: 13: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1883#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:21:23,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#true} {1733#true} #78#return; {1733#true} is VALID [2022-04-15 07:21:23,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#true} assume !(0 == ~cond); {1733#true} is VALID [2022-04-15 07:21:23,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#true} ~cond := #in~cond; {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#true} call #t~ret6 := main(); {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#true} {1733#true} #94#return; {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#true} assume true; {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1733#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(10, 2);call #Ultimate.allocInit(12, 3); {1733#true} is VALID [2022-04-15 07:21:23,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {1733#true} call ULTIMATE.init(); {1733#true} is VALID [2022-04-15 07:21:23,168 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:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531536746] [2022-04-15 07:21:23,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235103171] [2022-04-15 07:21:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235103171] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 07:21:23,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:21:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-15 07:21:23,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1979673585] [2022-04-15 07:21:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1979673585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:23,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:21:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964658177] [2022-04-15 07:21:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:23,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-15 07:21:23,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:23,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:23,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:23,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:21:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:21:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:21:23,197 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:23,540 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 07:21:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:21:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-04-15 07:21:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 07:21:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 07:21:23,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-15 07:21:23,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:23,596 INFO L225 Difference]: With dead ends: 69 [2022-04-15 07:21:23,596 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 07:21:23,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:21:23,597 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:23,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:21:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 07:21:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-04-15 07:21:23,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:23,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:21:23,621 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:21:23,622 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:21:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:23,624 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-15 07:21:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-15 07:21:23,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:23,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:23,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-15 07:21:23,624 INFO L87 Difference]: Start difference. First operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-15 07:21:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:23,626 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2022-04-15 07:21:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-15 07:21:23,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:23,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:23,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:23,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 07:21:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-04-15 07:21:23,628 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 44 [2022-04-15 07:21:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:23,628 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-04-15 07:21:23,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:21:23,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 77 transitions. [2022-04-15 07:21:23,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 07:21:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 07:21:23,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:23,712 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:23,732 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:23,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:23,920 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1615471943, now seen corresponding path program 1 times [2022-04-15 07:21:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:23,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625549599] [2022-04-15 07:21:32,857 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:32,858 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:32,858 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1615471943, now seen corresponding path program 2 times [2022-04-15 07:21:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:32,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441259570] [2022-04-15 07:21:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:32,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:32,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447777390] [2022-04-15 07:21:32,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:21:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:32,883 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:32,884 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:32,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:21:32,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:32,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 07:21:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:32,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:37,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2022-04-15 07:21:37,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {2408#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(10, 2);call #Ultimate.allocInit(12, 3); {2408#true} is VALID [2022-04-15 07:21:37,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #94#return; {2408#true} is VALID [2022-04-15 07:21:37,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret6 := main(); {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {2408#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2408#true} {2408#true} #78#return; {2408#true} is VALID [2022-04-15 07:21:37,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {2408#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,066 INFO L272 TraceCheckUtils]: 13: Hoare triple {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,072 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2408#true} {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,072 INFO L272 TraceCheckUtils]: 18: Hoare triple {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,073 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2408#true} {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,073 INFO L272 TraceCheckUtils]: 23: Hoare triple {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,074 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2408#true} {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {2446#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !false; {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,075 INFO L272 TraceCheckUtils]: 30: Hoare triple {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,076 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2408#true} {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #80#return; {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,076 INFO L272 TraceCheckUtils]: 35: Hoare triple {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,077 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2408#true} {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,077 INFO L272 TraceCheckUtils]: 40: Hoare triple {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,078 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2408#true} {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {2498#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !false; {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,079 INFO L272 TraceCheckUtils]: 47: Hoare triple {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,080 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2408#true} {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,080 INFO L272 TraceCheckUtils]: 52: Hoare triple {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:37,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:37,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:37,080 INFO L290 TraceCheckUtils]: 55: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:37,081 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2408#true} {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #88#return; {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:37,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {2550#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~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); {2587#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:37,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {2587#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2591#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 07:21:37,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {2591#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} assume !false; {2591#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 07:21:37,084 INFO L272 TraceCheckUtils]: 60: Hoare triple {2591#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:37,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {2598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:37,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {2602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2409#false} is VALID [2022-04-15 07:21:37,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {2409#false} assume !false; {2409#false} is VALID [2022-04-15 07:21:37,085 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,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:21:42,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {2409#false} assume !false; {2409#false} is VALID [2022-04-15 07:21:42,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {2602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2409#false} is VALID [2022-04-15 07:21:42,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {2598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:42,564 INFO L272 TraceCheckUtils]: 60: Hoare triple {2618#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:42,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {2618#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !false; {2618#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 07:21:42,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {2625#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2618#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 07:21:42,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~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); {2625#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-15 07:21:42,577 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2408#true} {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #88#return; {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:21:42,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,578 INFO L272 TraceCheckUtils]: 52: Hoare triple {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,580 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2408#true} {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #86#return; {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:21:42,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,580 INFO L272 TraceCheckUtils]: 47: Hoare triple {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !false; {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:21:42,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {2629#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:21:42,583 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2408#true} {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #84#return; {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:21:42,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,583 INFO L290 TraceCheckUtils]: 42: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,583 INFO L272 TraceCheckUtils]: 40: Hoare triple {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,584 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2408#true} {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #82#return; {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:21:42,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,584 INFO L272 TraceCheckUtils]: 35: Hoare triple {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,584 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2408#true} {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #80#return; {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:21:42,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,589 INFO L272 TraceCheckUtils]: 30: Hoare triple {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !false; {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:21:42,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2666#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:21:42,595 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2408#true} {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #84#return; {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 07:21:42,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,595 INFO L272 TraceCheckUtils]: 23: Hoare triple {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,596 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2408#true} {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #82#return; {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 07:21:42,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,596 INFO L272 TraceCheckUtils]: 18: Hoare triple {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,597 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2408#true} {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #80#return; {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 07:21:42,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,597 INFO L272 TraceCheckUtils]: 13: Hoare triple {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !false; {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 07:21:42,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {2408#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2718#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 07:21:42,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2408#true} {2408#true} #78#return; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {2408#true} assume !(0 == ~cond); {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {2408#true} ~cond := #in~cond; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {2408#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret6 := main(); {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #94#return; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2408#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(10, 2);call #Ultimate.allocInit(12, 3); {2408#true} is VALID [2022-04-15 07:21:42,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2022-04-15 07:21:42,600 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:42,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441259570] [2022-04-15 07:21:42,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:21:42,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447777390] [2022-04-15 07:21:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447777390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:21:42,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:21:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 07:21:42,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625549599] [2022-04-15 07:21:42,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625549599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:42,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:42,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:21:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244417621] [2022-04-15 07:21:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:42,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 64 [2022-04-15 07:21:42,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:42,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:21:42,643 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:21:42,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:21:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:21:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:21:42,644 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:21:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:43,604 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-15 07:21:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:21:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 64 [2022-04-15 07:21:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:21:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 07:21:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:21:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-15 07:21:43,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-15 07:21:43,694 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:21:43,696 INFO L225 Difference]: With dead ends: 124 [2022-04-15 07:21:43,696 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 07:21:43,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:21:43,697 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:43,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 186 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:21:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 07:21:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-15 07:21:43,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:43,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:21:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:21:43,775 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:21:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:43,778 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2022-04-15 07:21:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2022-04-15 07:21:43,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:43,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:43,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 101 states. [2022-04-15 07:21:43,779 INFO L87 Difference]: Start difference. First operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 101 states. [2022-04-15 07:21:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:43,782 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2022-04-15 07:21:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2022-04-15 07:21:43,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:43,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:43,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:43,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 25 states have call successors, (25), 14 states have call predecessors, (25), 13 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:21:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2022-04-15 07:21:43,786 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 64 [2022-04-15 07:21:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:43,786 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2022-04-15 07:21:43,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:21:43,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 117 transitions. [2022-04-15 07:21:43,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2022-04-15 07:21:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 07:21:43,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:43,917 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:43,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:21:44,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:44,118 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash -262609796, now seen corresponding path program 3 times [2022-04-15 07:21:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106427601] [2022-04-15 07:21:51,462 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:51,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:21:51,463 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:21:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash -262609796, now seen corresponding path program 4 times [2022-04-15 07:21:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:51,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52820331] [2022-04-15 07:21:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:51,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:21:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6481068] [2022-04-15 07:21:51,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:21:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:21:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:21:51,473 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:51,474 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:51,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:21:51,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:21:51,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 07:21:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:51,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:21:52,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {3455#true} call ULTIMATE.init(); {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {3455#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(10, 2);call #Ultimate.allocInit(12, 3); {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3455#true} {3455#true} #94#return; {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {3455#true} call #t~ret6 := main(); {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {3455#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3455#true} is VALID [2022-04-15 07:21:52,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {3455#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3455#true} {3455#true} #78#return; {3455#true} is VALID [2022-04-15 07:21:52,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {3455#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,508 INFO L272 TraceCheckUtils]: 13: Hoare triple {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,509 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3455#true} {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,509 INFO L272 TraceCheckUtils]: 18: Hoare triple {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3455#true} {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,510 INFO L272 TraceCheckUtils]: 23: Hoare triple {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {3455#true} ~cond := #in~cond; {3533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:52,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {3533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:52,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:21:52,512 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} {3493#(and (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {3544#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {3544#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:52,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !false; {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:52,513 INFO L272 TraceCheckUtils]: 30: Hoare triple {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,514 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3455#true} {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #80#return; {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:52,514 INFO L272 TraceCheckUtils]: 35: Hoare triple {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,515 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3455#true} {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:52,515 INFO L272 TraceCheckUtils]: 40: Hoare triple {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,516 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3455#true} {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 07:21:52,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {3548#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 07:21:52,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} assume !false; {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 07:21:52,518 INFO L272 TraceCheckUtils]: 47: Hoare triple {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,518 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3455#true} {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} #86#return; {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 07:21:52,519 INFO L272 TraceCheckUtils]: 52: Hoare triple {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,519 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3455#true} {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} #88#return; {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 07:21:52,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {3600#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {3637#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {3637#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,521 INFO L272 TraceCheckUtils]: 60: Hoare triple {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:21:52,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:21:52,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:21:52,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:21:52,522 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3455#true} {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:21:52,523 INFO L272 TraceCheckUtils]: 65: Hoare triple {3641#(and (= main_~d~0 (mod main_~B~0 4294967296)) (< 0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:21:52,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {3663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:21:52,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {3667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3456#false} is VALID [2022-04-15 07:21:52,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {3456#false} assume !false; {3456#false} is VALID [2022-04-15 07:21:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 23 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 07:21:52,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:22:30,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {3456#false} assume !false; {3456#false} is VALID [2022-04-15 07:22:30,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {3667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3456#false} is VALID [2022-04-15 07:22:30,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {3663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:30,143 INFO L272 TraceCheckUtils]: 65: Hoare triple {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:30,144 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3455#true} {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:22:30,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,144 INFO L272 TraceCheckUtils]: 60: Hoare triple {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:22:30,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:22:30,155 INFO L290 TraceCheckUtils]: 57: Hoare triple {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (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); {3683#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:22:30,155 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3455#true} {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #88#return; {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:22:30,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,156 INFO L272 TraceCheckUtils]: 52: Hoare triple {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,156 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3455#true} {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #86#return; {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:22:30,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,157 INFO L272 TraceCheckUtils]: 47: Hoare triple {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !false; {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:22:30,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {3708#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:22:30,159 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3455#true} {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #84#return; {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:22:30,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,160 INFO L272 TraceCheckUtils]: 40: Hoare triple {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,160 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3455#true} {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #82#return; {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:22:30,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L272 TraceCheckUtils]: 35: Hoare triple {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3455#true} {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #80#return; {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:22:30,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,161 INFO L272 TraceCheckUtils]: 30: Hoare triple {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} assume !false; {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:22:30,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {3797#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3745#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:22:30,167 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} {3455#true} #84#return; {3797#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:22:30,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:30,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {3810#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:22:30,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {3455#true} ~cond := #in~cond; {3810#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:22:30,168 INFO L272 TraceCheckUtils]: 23: Hoare triple {3455#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,168 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3455#true} {3455#true} #82#return; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {3455#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3455#true} {3455#true} #80#return; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {3455#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {3455#true} assume !false; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {3455#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3455#true} {3455#true} #78#return; {3455#true} is VALID [2022-04-15 07:22:30,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {3455#true} assume !(0 == ~cond); {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3455#true} ~cond := #in~cond; {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {3455#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {3455#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {3455#true} call #t~ret6 := main(); {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3455#true} {3455#true} #94#return; {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3455#true} assume true; {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {3455#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(10, 2);call #Ultimate.allocInit(12, 3); {3455#true} is VALID [2022-04-15 07:22:30,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {3455#true} call ULTIMATE.init(); {3455#true} is VALID [2022-04-15 07:22:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 07:22:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52820331] [2022-04-15 07:22:30,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:22:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6481068] [2022-04-15 07:22:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6481068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:22:30,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:22:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2022-04-15 07:22:30,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106427601] [2022-04-15 07:22:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106427601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:30,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:30,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:22:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047113972] [2022-04-15 07:22:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:30,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:22:30,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:30,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:22:30,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:30,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:22:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:22:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:22:30,224 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:22:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:31,633 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-04-15 07:22:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:22:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-15 07:22:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:22:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-15 07:22:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:22:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-15 07:22:31,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-15 07:22:31,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:31,723 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:22:31,723 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 07:22:31,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:22:31,724 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:31,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:22:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 07:22:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 07:22:31,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:31,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:22:31,783 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:22:31,783 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:22:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:31,785 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-04-15 07:22:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-04-15 07:22:31,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:31,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:31,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 103 states. [2022-04-15 07:22:31,786 INFO L87 Difference]: Start difference. First operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 103 states. [2022-04-15 07:22:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:31,796 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-04-15 07:22:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-04-15 07:22:31,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:31,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:31,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:31,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 26 states have call successors, (26), 15 states have call predecessors, (26), 14 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 07:22:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-04-15 07:22:31,800 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 69 [2022-04-15 07:22:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:31,800 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-04-15 07:22:31,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 07:22:31,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 118 transitions. [2022-04-15 07:22:31,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-04-15 07:22:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 07:22:31,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:31,943 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:31,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 07:22:32,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:32,153 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1554666020, now seen corresponding path program 1 times [2022-04-15 07:22:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:32,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [458952334] [2022-04-15 07:22:41,359 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:41,359 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:22:41,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:22:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1554666020, now seen corresponding path program 2 times [2022-04-15 07:22:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176212947] [2022-04-15 07:22:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:41,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:22:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008969272] [2022-04-15 07:22:41,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:22:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:22:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:22:41,369 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:41,369 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:41,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:22:41,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:22:41,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:22:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:41,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:22:41,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {4555#true} call ULTIMATE.init(); {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {4555#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(10, 2);call #Ultimate.allocInit(12, 3); {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4555#true} {4555#true} #94#return; {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {4555#true} call #t~ret6 := main(); {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {4555#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4555#true} is VALID [2022-04-15 07:22:41,710 INFO L272 TraceCheckUtils]: 6: Hoare triple {4555#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4555#true} {4555#true} #78#return; {4555#true} is VALID [2022-04-15 07:22:41,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {4555#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,712 INFO L272 TraceCheckUtils]: 13: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,713 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,713 INFO L272 TraceCheckUtils]: 18: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,714 INFO L272 TraceCheckUtils]: 23: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,714 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,715 INFO L272 TraceCheckUtils]: 30: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,716 INFO L272 TraceCheckUtils]: 35: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,717 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,717 INFO L272 TraceCheckUtils]: 40: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,718 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,719 INFO L272 TraceCheckUtils]: 47: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,721 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,721 INFO L272 TraceCheckUtils]: 52: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,722 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #88#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:22:41,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:22:41,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} assume !false; {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:22:41,724 INFO L272 TraceCheckUtils]: 60: Hoare triple {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,724 INFO L290 TraceCheckUtils]: 63: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,724 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4555#true} {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} #86#return; {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:22:41,725 INFO L272 TraceCheckUtils]: 65: Hoare triple {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:22:41,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:22:41,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:22:41,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:22:41,725 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4555#true} {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} #88#return; {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:22:41,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {4735#(and (= main_~q~0 main_~p~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)))} assume !(1 != ~p~0); {4772#(and (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-15 07:22:41,726 INFO L272 TraceCheckUtils]: 71: Hoare triple {4772#(and (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:22:41,727 INFO L290 TraceCheckUtils]: 72: Hoare triple {4776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:22:41,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {4780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4556#false} is VALID [2022-04-15 07:22:41,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {4556#false} assume !false; {4556#false} is VALID [2022-04-15 07:22:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-04-15 07:22:41,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:23:03,815 INFO L290 TraceCheckUtils]: 74: Hoare triple {4556#false} assume !false; {4556#false} is VALID [2022-04-15 07:23:03,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {4780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4556#false} is VALID [2022-04-15 07:23:03,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {4776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:23:03,817 INFO L272 TraceCheckUtils]: 71: Hoare triple {4796#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:23:03,817 INFO L290 TraceCheckUtils]: 70: Hoare triple {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {4796#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-15 07:23:03,818 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {4555#true} {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} #88#return; {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,818 INFO L272 TraceCheckUtils]: 65: Hoare triple {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,819 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4555#true} {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} #86#return; {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,819 INFO L272 TraceCheckUtils]: 60: Hoare triple {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} assume !false; {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4800#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:23:03,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,822 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #88#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,823 INFO L272 TraceCheckUtils]: 52: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,827 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,828 INFO L272 TraceCheckUtils]: 47: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,829 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,829 INFO L272 TraceCheckUtils]: 40: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,829 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L272 TraceCheckUtils]: 35: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,830 INFO L272 TraceCheckUtils]: 30: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,832 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,832 INFO L272 TraceCheckUtils]: 23: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,832 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,833 INFO L272 TraceCheckUtils]: 18: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,833 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4555#true} {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,834 INFO L272 TraceCheckUtils]: 13: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {4555#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4593#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:23:03,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4555#true} {4555#true} #78#return; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {4555#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {4555#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {4555#true} call #t~ret6 := main(); {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4555#true} {4555#true} #94#return; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {4555#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(10, 2);call #Ultimate.allocInit(12, 3); {4555#true} is VALID [2022-04-15 07:23:03,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {4555#true} call ULTIMATE.init(); {4555#true} is VALID [2022-04-15 07:23:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-04-15 07:23:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:23:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176212947] [2022-04-15 07:23:03,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:23:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008969272] [2022-04-15 07:23:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008969272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:23:03,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:23:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 07:23:03,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:23:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [458952334] [2022-04-15 07:23:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [458952334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:23:03,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:23:03,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:23:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837068131] [2022-04-15 07:23:03,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:23:03,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-04-15 07:23:03,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:23:03,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:23:03,886 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:23:03,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:23:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:23:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:23:03,887 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:23:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,293 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-04-15 07:23:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:23:04,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-04-15 07:23:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:23:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:23:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 07:23:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:23:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-15 07:23:04,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-15 07:23:04,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:04,350 INFO L225 Difference]: With dead ends: 116 [2022-04-15 07:23:04,350 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:23:04,350 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:23:04,351 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:23:04,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:23:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:23:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2022-04-15 07:23:04,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:23:04,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:23:04,391 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:23:04,391 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:23:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,394 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-15 07:23:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-15 07:23:04,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:04,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:04,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) Second operand 92 states. [2022-04-15 07:23:04,395 INFO L87 Difference]: Start difference. First operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) Second operand 92 states. [2022-04-15 07:23:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:23:04,396 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-15 07:23:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-15 07:23:04,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:23:04,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:23:04,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:23:04,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:23:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-15 07:23:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-04-15 07:23:04,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 75 [2022-04-15 07:23:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:23:04,399 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-04-15 07:23:04,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 07:23:04,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 106 transitions. [2022-04-15 07:23:04,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:23:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-04-15 07:23:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 07:23:04,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:23:04,523 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:23:04,541 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,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:04,726 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:23:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:23:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash 330473976, now seen corresponding path program 5 times [2022-04-15 07:23:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:23:04,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869188529] [2022-04-15 07:23:14,684 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:14,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:23:14,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:23:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 330473976, now seen corresponding path program 6 times [2022-04-15 07:23:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:23:14,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596012151] [2022-04-15 07:23:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:23:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:23:14,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:23:14,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272015048] [2022-04-15 07:23:14,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:23:14,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:23:14,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:23:14,712 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:14,713 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:14,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:23:14,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:23:14,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 07:23:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:23:14,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:24:25,841 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:24:28,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {5613#true} call ULTIMATE.init(); {5613#true} is VALID [2022-04-15 07:24:28,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {5613#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(10, 2);call #Ultimate.allocInit(12, 3); {5613#true} is VALID [2022-04-15 07:24:28,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5613#true} {5613#true} #94#return; {5613#true} is VALID [2022-04-15 07:24:28,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {5613#true} call #t~ret6 := main(); {5613#true} is VALID [2022-04-15 07:24:28,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {5613#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {5613#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5613#true} {5613#true} #78#return; {5613#true} is VALID [2022-04-15 07:24:28,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {5613#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,736 INFO L272 TraceCheckUtils]: 18: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,737 INFO L272 TraceCheckUtils]: 23: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,738 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !false; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,739 INFO L272 TraceCheckUtils]: 30: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #80#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,739 INFO L272 TraceCheckUtils]: 35: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,740 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,740 INFO L272 TraceCheckUtils]: 40: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,741 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5613#true} {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {5651#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5754#(and (= (mod main_~A~0 4294967296) 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:24:28,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {5754#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {5754#(and (= (mod main_~A~0 4294967296) 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:24:28,742 INFO L272 TraceCheckUtils]: 47: Hoare triple {5754#(and (= (mod main_~A~0 4294967296) 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)); {5613#true} is VALID [2022-04-15 07:24:28,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,743 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5613#true} {5754#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {5754#(and (= (mod main_~A~0 4294967296) 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:24:28,743 INFO L272 TraceCheckUtils]: 52: Hoare triple {5754#(and (= (mod main_~A~0 4294967296) 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 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,743 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5613#true} {5754#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {5754#(and (= (mod main_~A~0 4294967296) 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:24:28,743 INFO L272 TraceCheckUtils]: 57: Hoare triple {5754#(and (= (mod main_~A~0 4294967296) 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 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {5613#true} ~cond := #in~cond; {5794#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:28,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:28,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:24:28,750 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} {5754#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:24:28,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:24:28,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:24:28,751 INFO L272 TraceCheckUtils]: 64: Hoare triple {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,752 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5613#true} {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #86#return; {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:24:28,752 INFO L272 TraceCheckUtils]: 69: Hoare triple {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:24:28,752 INFO L290 TraceCheckUtils]: 70: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:24:28,752 INFO L290 TraceCheckUtils]: 71: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:24:28,752 INFO L290 TraceCheckUtils]: 72: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:24:28,752 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5613#true} {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #88#return; {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:24:28,756 INFO L290 TraceCheckUtils]: 74: Hoare triple {5805#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= (mod main_~d~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); {5845#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 07:24:28,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {5845#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:24:28,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !false; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:24:28,759 INFO L272 TraceCheckUtils]: 77: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:24:28,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {5856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:24:28,760 INFO L290 TraceCheckUtils]: 79: Hoare triple {5860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5614#false} is VALID [2022-04-15 07:24:28,760 INFO L290 TraceCheckUtils]: 80: Hoare triple {5614#false} assume !false; {5614#false} is VALID [2022-04-15 07:24:28,760 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:24:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:25:13,447 WARN L232 SmtUtils]: Spent 18.22s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:26:34,639 INFO L290 TraceCheckUtils]: 80: Hoare triple {5614#false} assume !false; {5614#false} is VALID [2022-04-15 07:26:34,639 INFO L290 TraceCheckUtils]: 79: Hoare triple {5860#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5614#false} is VALID [2022-04-15 07:26:34,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {5856#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5860#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:34,640 INFO L272 TraceCheckUtils]: 77: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5856#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:34,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !false; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {5882#(= (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) main_~d~0 (* (- 1) main_~r~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~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); {5882#(= (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) main_~d~0 (* (- 1) main_~r~0)))} is VALID [2022-04-15 07:26:34,651 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5613#true} {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #88#return; {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:34,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,651 INFO L272 TraceCheckUtils]: 69: Hoare triple {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,652 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5613#true} {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #86#return; {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:34,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,652 INFO L272 TraceCheckUtils]: 64: Hoare triple {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !false; {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:34,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !(~r~0 >= ~d~0); {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:34,656 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #84#return; {5886#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:26:34,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:34,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {5936#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5798#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:26:34,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {5613#true} ~cond := #in~cond; {5936#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:26:34,657 INFO L272 TraceCheckUtils]: 57: Hoare triple {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,658 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5613#true} {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #82#return; {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-15 07:26:34,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,658 INFO L272 TraceCheckUtils]: 52: Hoare triple {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,659 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5613#true} {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} #80#return; {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-15 07:26:34,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,659 INFO L272 TraceCheckUtils]: 47: Hoare triple {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} assume !false; {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-15 07:26:34,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5926#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (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)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (= (mod main_~p~0 2) 0)) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (or (= (mod main_~p~0 2) 0) (= (+ (mod main_~A~0 4294967296) (div main_~d~0 2) (* (- 1) main_~r~0) 1) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))))))} is VALID [2022-04-15 07:26:34,665 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #84#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L272 TraceCheckUtils]: 40: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #82#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,666 INFO L272 TraceCheckUtils]: 35: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,666 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #80#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,666 INFO L272 TraceCheckUtils]: 30: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !false; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,667 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #84#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L272 TraceCheckUtils]: 23: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #82#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,668 INFO L272 TraceCheckUtils]: 18: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5613#true} {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} #80#return; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,669 INFO L272 TraceCheckUtils]: 13: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} assume !false; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {5613#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5849#(= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) (* main_~q~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:34,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5613#true} {5613#true} #78#return; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {5613#true} assume !(0 == ~cond); {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {5613#true} ~cond := #in~cond; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {5613#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {5613#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {5613#true} call #t~ret6 := main(); {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5613#true} {5613#true} #94#return; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {5613#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(10, 2);call #Ultimate.allocInit(12, 3); {5613#true} is VALID [2022-04-15 07:26:34,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {5613#true} call ULTIMATE.init(); {5613#true} is VALID [2022-04-15 07:26:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 45 proven. 19 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-15 07:26:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596012151] [2022-04-15 07:26:34,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272015048] [2022-04-15 07:26:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272015048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:26:34,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:26:34,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2022-04-15 07:26:34,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869188529] [2022-04-15 07:26:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869188529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:26:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854275445] [2022-04-15 07:26:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 81 [2022-04-15 07:26:34,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:34,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:26:34,717 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:26:34,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:26:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:34,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:26:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2022-04-15 07:26:34,718 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:26:38,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:26:42,126 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:26:44,143 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:26:46,311 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:26:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:46,584 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2022-04-15 07:26:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:26:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 81 [2022-04-15 07:26:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:26:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-15 07:26:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:26:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-15 07:26:46,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2022-04-15 07:26:46,686 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:26:46,688 INFO L225 Difference]: With dead ends: 116 [2022-04-15 07:26:46,688 INFO L226 Difference]: Without dead ends: 104 [2022-04-15 07:26:46,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2022-04-15 07:26:46,689 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:46,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 142 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 272 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-04-15 07:26:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-15 07:26:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-04-15 07:26:46,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:46,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:46,745 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:46,745 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:46,748 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-04-15 07:26:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2022-04-15 07:26:46,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:46,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:46,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) Second operand 104 states. [2022-04-15 07:26:46,749 INFO L87 Difference]: Start difference. First operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) Second operand 104 states. [2022-04-15 07:26:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:46,753 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-04-15 07:26:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2022-04-15 07:26:46,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:46,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:46,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:46,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 67 states have internal predecessors, (69), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 21 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 07:26:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-04-15 07:26:46,758 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 81 [2022-04-15 07:26:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:46,758 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-04-15 07:26:46,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 07:26:46,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 123 transitions. [2022-04-15 07:26:46,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-04-15 07:26:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 07:26:46,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:46,930 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:46,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:26:47,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:47,136 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -454578581, now seen corresponding path program 7 times [2022-04-15 07:26:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:47,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68715602] [2022-04-15 07:26:55,923 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:55,924 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:26:55,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:26:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -454578581, now seen corresponding path program 8 times [2022-04-15 07:26:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:55,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796814526] [2022-04-15 07:26:55,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:55,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:55,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906769170] [2022-04-15 07:26:55,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:26:55,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:55,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:55,933 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:26:55,934 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:26:55,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:26:55,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:55,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 07:26:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:56,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:57,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {6763#true} call ULTIMATE.init(); {6763#true} is VALID [2022-04-15 07:26:57,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {6763#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(10, 2);call #Ultimate.allocInit(12, 3); {6763#true} is VALID [2022-04-15 07:26:57,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6763#true} {6763#true} #94#return; {6763#true} is VALID [2022-04-15 07:26:57,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {6763#true} call #t~ret6 := main(); {6763#true} is VALID [2022-04-15 07:26:57,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {6763#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6763#true} is VALID [2022-04-15 07:26:57,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {6763#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {6763#true} ~cond := #in~cond; {6789#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:26:57,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {6789#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6793#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:57,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {6793#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6793#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:57,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6793#(not (= |assume_abort_if_not_#in~cond| 0))} {6763#true} #78#return; {6800#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 07:26:57,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {6800#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:26:57,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !false; {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:26:57,441 INFO L272 TraceCheckUtils]: 13: Hoare triple {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6763#true} {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #80#return; {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:26:57,442 INFO L272 TraceCheckUtils]: 18: Hoare triple {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6763#true} {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:26:57,442 INFO L272 TraceCheckUtils]: 23: Hoare triple {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,443 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6763#true} {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:26:57,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {6804#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !false; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,445 INFO L272 TraceCheckUtils]: 30: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6763#true} {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #80#return; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,446 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6763#true} {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,446 INFO L272 TraceCheckUtils]: 40: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,447 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6763#true} {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !false; {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,448 INFO L272 TraceCheckUtils]: 47: Hoare triple {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,449 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6763#true} {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #80#return; {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,449 INFO L272 TraceCheckUtils]: 52: Hoare triple {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,450 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6763#true} {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #82#return; {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,450 INFO L272 TraceCheckUtils]: 57: Hoare triple {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,450 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6763#true} {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #84#return; {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {6908#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !false; {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,451 INFO L272 TraceCheckUtils]: 64: Hoare triple {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,452 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6763#true} {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #86#return; {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,452 INFO L272 TraceCheckUtils]: 69: Hoare triple {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,452 INFO L290 TraceCheckUtils]: 71: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,453 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6763#true} {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #88#return; {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 07:26:57,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {6960#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= 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); {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !false; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,455 INFO L272 TraceCheckUtils]: 77: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:26:57,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:26:57,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:26:57,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:26:57,456 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6763#true} {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #86#return; {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:26:57,459 INFO L272 TraceCheckUtils]: 82: Hoare triple {6856#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:57,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {7021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:57,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {7025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6764#false} is VALID [2022-04-15 07:26:57,463 INFO L290 TraceCheckUtils]: 85: Hoare triple {6764#false} assume !false; {6764#false} is VALID [2022-04-15 07:26:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 07:26:57,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:27:01,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {6764#false} assume !false; {6764#false} is VALID [2022-04-15 07:27:01,896 INFO L290 TraceCheckUtils]: 84: Hoare triple {7025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6764#false} is VALID [2022-04-15 07:27:01,896 INFO L290 TraceCheckUtils]: 83: Hoare triple {7021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:01,897 INFO L272 TraceCheckUtils]: 82: Hoare triple {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:01,897 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6763#true} {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:27:01,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,897 INFO L272 TraceCheckUtils]: 77: Hoare triple {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:27:01,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:27:01,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (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); {7041#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:27:01,913 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6763#true} {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #88#return; {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:27:01,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,914 INFO L290 TraceCheckUtils]: 71: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,914 INFO L272 TraceCheckUtils]: 69: Hoare triple {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,914 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6763#true} {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #86#return; {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:27:01,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,915 INFO L290 TraceCheckUtils]: 65: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,915 INFO L272 TraceCheckUtils]: 64: Hoare triple {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !false; {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:27:01,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} assume !(~r~0 >= ~d~0); {7066#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 07:27:01,917 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6763#true} {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #84#return; {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 07:27:01,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,917 INFO L290 TraceCheckUtils]: 59: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,917 INFO L290 TraceCheckUtils]: 58: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,917 INFO L272 TraceCheckUtils]: 57: Hoare triple {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,918 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6763#true} {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #82#return; {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 07:27:01,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,918 INFO L272 TraceCheckUtils]: 52: Hoare triple {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,919 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6763#true} {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #80#return; {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 07:27:01,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,919 INFO L272 TraceCheckUtils]: 47: Hoare triple {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} assume !false; {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 07:27:01,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7103#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 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)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 07:27:01,924 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,924 INFO L272 TraceCheckUtils]: 40: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,924 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L272 TraceCheckUtils]: 35: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #80#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,926 INFO L272 TraceCheckUtils]: 30: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !false; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,928 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,928 INFO L272 TraceCheckUtils]: 23: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,928 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6763#true} {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #80#return; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,930 INFO L272 TraceCheckUtils]: 13: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !false; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {6763#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7155#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 07:27:01,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6763#true} {6763#true} #78#return; {6763#true} is VALID [2022-04-15 07:27:01,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {6763#true} assume !(0 == ~cond); {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {6763#true} ~cond := #in~cond; {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {6763#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {6763#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {6763#true} call #t~ret6 := main(); {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6763#true} {6763#true} #94#return; {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {6763#true} assume true; {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {6763#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(10, 2);call #Ultimate.allocInit(12, 3); {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {6763#true} call ULTIMATE.init(); {6763#true} is VALID [2022-04-15 07:27:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-04-15 07:27:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:27:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796814526] [2022-04-15 07:27:01,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:27:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906769170] [2022-04-15 07:27:01,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906769170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:27:01,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:27:01,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-15 07:27:01,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:27:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68715602] [2022-04-15 07:27:01,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68715602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:27:01,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:27:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:27:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293553942] [2022-04-15 07:27:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:27:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-15 07:27:01,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:27:01,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:27:02,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:02,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:27:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:27:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:27:02,007 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:27:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:04,134 INFO L93 Difference]: Finished difference Result 191 states and 248 transitions. [2022-04-15 07:27:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:27:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 86 [2022-04-15 07:27:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:27:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:27:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 07:27:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:27:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 07:27:04,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-04-15 07:27:04,237 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:27:04,239 INFO L225 Difference]: With dead ends: 191 [2022-04-15 07:27:04,239 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 07:27:04,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:27:04,240 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:27:04,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 291 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:27:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 07:27:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-15 07:27:04,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:27:04,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 07:27:04,348 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 07:27:04,349 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 07:27:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:04,352 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2022-04-15 07:27:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2022-04-15 07:27:04,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:04,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:04,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) Second operand 144 states. [2022-04-15 07:27:04,356 INFO L87 Difference]: Start difference. First operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) Second operand 144 states. [2022-04-15 07:27:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:04,359 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2022-04-15 07:27:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2022-04-15 07:27:04,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:04,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:04,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:27:04,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:27:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 94 states have internal predecessors, (96), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 07:27:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2022-04-15 07:27:04,363 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 86 [2022-04-15 07:27:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:27:04,363 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2022-04-15 07:27:04,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-15 07:27:04,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 176 transitions. [2022-04-15 07:27:04,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2022-04-15 07:27:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 07:27:04,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:27:04,588 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:27:04,604 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:27:04,804 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,SelfDestructingSolverStorable10 [2022-04-15 07:27:04,804 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:27:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:27:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -132947769, now seen corresponding path program 9 times [2022-04-15 07:27:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488213362] [2022-04-15 07:27:11,719 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:11,720 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:27:11,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:27:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -132947769, now seen corresponding path program 10 times [2022-04-15 07:27:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:27:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334079755] [2022-04-15 07:27:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:27:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:27:11,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:27:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140949241] [2022-04-15 07:27:11,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:27:11,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:27:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:27:11,760 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:27:11,761 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:27:11,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:27:11,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:27:11,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 07:27:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:27:11,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:27:37,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {8255#true} call ULTIMATE.init(); {8255#true} is VALID [2022-04-15 07:27:37,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#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(10, 2);call #Ultimate.allocInit(12, 3); {8255#true} is VALID [2022-04-15 07:27:37,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8255#true} {8255#true} #94#return; {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#true} call #t~ret6 := main(); {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {8255#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8255#true} {8255#true} #78#return; {8255#true} is VALID [2022-04-15 07:27:37,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {8255#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:27:37,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:27:37,920 INFO L272 TraceCheckUtils]: 13: Hoare triple {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,921 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8255#true} {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:27:37,921 INFO L272 TraceCheckUtils]: 18: Hoare triple {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,922 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8255#true} {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:27:37,922 INFO L272 TraceCheckUtils]: 23: Hoare triple {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,923 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8255#true} {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:27:37,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {8293#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !false; {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,926 INFO L272 TraceCheckUtils]: 30: Hoare triple {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,927 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8255#true} {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,927 INFO L272 TraceCheckUtils]: 35: Hoare triple {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,928 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8255#true} {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,929 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8255#true} {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {8345#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} assume !false; {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,932 INFO L272 TraceCheckUtils]: 47: Hoare triple {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,935 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8255#true} {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} #80#return; {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,935 INFO L272 TraceCheckUtils]: 52: Hoare triple {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,936 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8255#true} {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,936 INFO L272 TraceCheckUtils]: 57: Hoare triple {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,936 INFO L290 TraceCheckUtils]: 59: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,937 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8255#true} {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {8397#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} assume !false; {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,938 INFO L272 TraceCheckUtils]: 64: Hoare triple {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,941 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8255#true} {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,941 INFO L272 TraceCheckUtils]: 69: Hoare triple {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,941 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8255#true} {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} #88#return; {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 07:27:37,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {8449#(and (<= (div (div main_~d~0 2) 2) (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div main_~d~0 2) 2) 0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= 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); {8486#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0))} is VALID [2022-04-15 07:27:37,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {8486#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} is VALID [2022-04-15 07:27:37,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} assume !false; {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} is VALID [2022-04-15 07:27:37,946 INFO L272 TraceCheckUtils]: 77: Hoare triple {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:27:37,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:27:37,946 INFO L290 TraceCheckUtils]: 80: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:27:37,947 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8255#true} {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} #86#return; {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} is VALID [2022-04-15 07:27:37,947 INFO L272 TraceCheckUtils]: 82: Hoare triple {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:27:37,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {8255#true} ~cond := #in~cond; {8515#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:37,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {8515#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:37,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:37,949 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} {8490#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= (div main_~d~0 2) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= (mod (div (* main_~d~0 2) 2) 2) 0) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} #88#return; {8526#(and (= main_~q~0 main_~p~0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)))} is VALID [2022-04-15 07:27:37,951 INFO L290 TraceCheckUtils]: 87: Hoare triple {8526#(and (= main_~q~0 main_~p~0) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 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); {8530#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= main_~d~0 (div (* main_~q~0 (mod main_~B~0 4294967296)) 2)) (< (* main_~q~0 (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) 1)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* 2 (* main_~q~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 07:27:37,955 INFO L290 TraceCheckUtils]: 88: Hoare triple {8530#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= main_~d~0 (div (* main_~q~0 (mod main_~B~0 4294967296)) 2)) (< (* main_~q~0 (mod main_~B~0 4294967296)) (+ (mod main_~A~0 4294967296) 1)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* 2 (* main_~q~0 (mod main_~B~0 4294967296)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8534#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:27:37,955 INFO L290 TraceCheckUtils]: 89: Hoare triple {8534#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} assume !false; {8534#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 07:27:37,956 INFO L272 TraceCheckUtils]: 90: Hoare triple {8534#(and (< (mod main_~A~0 4294967296) (* (mod main_~B~0 4294967296) 4)) (= main_~q~0 3) (= (+ main_~r~0 (* 3 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* 3 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:37,956 INFO L290 TraceCheckUtils]: 91: Hoare triple {8541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:37,957 INFO L290 TraceCheckUtils]: 92: Hoare triple {8545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8256#false} is VALID [2022-04-15 07:27:37,957 INFO L290 TraceCheckUtils]: 93: Hoare triple {8256#false} assume !false; {8256#false} is VALID [2022-04-15 07:27:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 61 proven. 25 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 07:27:37,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:28:20,255 WARN L232 SmtUtils]: Spent 22.89s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:29:53,387 WARN L232 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:30:19,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_main_~B~0 4294967296)) (.cse19 (div c_main_~p~0 2)) (.cse21 (< c_main_~d~0 0)) (.cse4 (= (mod c_main_~d~0 2) 0)) (.cse2 (div c_main_~d~0 2))) (let ((.cse3 (+ .cse2 1)) (.cse0 (and .cse21 (not .cse4))) (.cse13 (mod c_main_~A~0 4294967296)) (.cse9 (* .cse8 .cse19)) (.cse5 (= (mod c_main_~p~0 2) 0)) (.cse6 (< c_main_~p~0 0))) (and (let ((.cse20 (+ .cse19 1))) (let ((.cse1 (* .cse20 .cse8))) (or (and (or .cse0 (not (= .cse1 .cse2))) (or (not (= .cse3 .cse1)) .cse4)) .cse5 (not .cse6) (let ((.cse18 (div .cse20 2)) (.cse14 (= (mod .cse20 2) 0))) (let ((.cse15 (not .cse14)) (.cse16 (* (+ c_main_~q~0 .cse18 .cse19 1) .cse8)) (.cse10 (* (- 1) (div .cse1 2))) (.cse11 (* .cse8 (+ c_main_~q~0 .cse18 2 .cse19))) (.cse12 (* (- 1) .cse1)) (.cse7 (div (+ .cse8 .cse9) 2)) (.cse17 (= (mod .cse1 2) 0))) (and (or (not (<= (+ .cse7 .cse8 .cse9 1) c_main_~r~0)) (and (or (= (+ (- 1) .cse10 .cse11 c_main_~r~0 .cse12) .cse13) .cse14) (or .cse15 (= (+ (- 1) .cse10 c_main_~r~0 .cse16 .cse12) .cse13))) .cse17) (or (and (or .cse15 (= .cse13 (+ .cse10 c_main_~r~0 .cse16 .cse12))) (or (= .cse13 (+ .cse10 .cse11 c_main_~r~0 .cse12)) .cse14)) (not (<= (+ .cse7 .cse8 .cse9) c_main_~r~0)) (not .cse17)))))))) (or (and (or (not (= .cse3 .cse9)) .cse4 (not .cse21)) (or .cse0 (not (= .cse2 .cse9)))) (let ((.cse30 (= (mod .cse19 2) 0)) (.cse22 (div .cse9 2)) (.cse32 (div .cse19 2))) (let ((.cse31 (* .cse8 (+ c_main_~q~0 .cse19 .cse32 1))) (.cse27 (* (- 1) .cse22)) (.cse28 (* (- 1) .cse9)) (.cse29 (* .cse8 (+ c_main_~q~0 .cse19 .cse32))) (.cse25 (not .cse30)) (.cse23 (= (mod .cse9 2) 0)) (.cse24 (< .cse9 0))) (and (or (not (<= (+ .cse9 .cse22) c_main_~r~0)) (and (not .cse23) .cse24) (let ((.cse26 (< .cse19 0))) (and (or (and .cse25 .cse26) (= (+ .cse27 .cse28 .cse29 c_main_~r~0) .cse13)) (or (not .cse26) .cse30 (= .cse13 (+ .cse31 .cse27 .cse28 c_main_~r~0)))))) (or (and (or .cse30 (= .cse13 (+ (- 1) .cse31 .cse27 .cse28 c_main_~r~0))) (or (= (+ (- 1) .cse27 .cse28 .cse29 c_main_~r~0) .cse13) .cse25)) .cse23 (not (<= (+ .cse9 1 .cse22) c_main_~r~0)) (not .cse24))))) (and (not .cse5) .cse6))))) is different from false [2022-04-15 07:32:00,614 INFO L290 TraceCheckUtils]: 93: Hoare triple {8256#false} assume !false; {8256#false} is VALID [2022-04-15 07:32:00,614 INFO L290 TraceCheckUtils]: 92: Hoare triple {8545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8256#false} is VALID [2022-04-15 07:32:00,615 INFO L290 TraceCheckUtils]: 91: Hoare triple {8541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:00,615 INFO L272 TraceCheckUtils]: 90: Hoare triple {8561#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:32:00,616 INFO L290 TraceCheckUtils]: 89: Hoare triple {8561#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !false; {8561#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 07:32:00,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {8568#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8561#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 07:32:00,634 INFO L290 TraceCheckUtils]: 87: Hoare triple {8572#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8568#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0)))} is VALID [2022-04-15 07:32:00,639 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #88#return; {8572#(and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0)))} is VALID [2022-04-15 07:32:00,639 INFO L290 TraceCheckUtils]: 85: Hoare triple {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:00,640 INFO L290 TraceCheckUtils]: 84: Hoare triple {8586#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:00,640 INFO L290 TraceCheckUtils]: 83: Hoare triple {8255#true} ~cond := #in~cond; {8586#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:32:00,640 INFO L272 TraceCheckUtils]: 82: Hoare triple {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,641 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8255#true} {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #86#return; {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 07:32:00,641 INFO L290 TraceCheckUtils]: 80: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,641 INFO L272 TraceCheckUtils]: 77: Hoare triple {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} assume !false; {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 07:32:00,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {8611#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0))) (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (<= (+ main_~d~0 (div main_~d~0 2) 1) main_~r~0)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8576#(or (and (or (not (<= (div main_~d~0 2) main_~r~0)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))) (or (not (< main_~d~0 0)) (not (<= (+ (div main_~d~0 2) 1) main_~r~0)) (= (mod main_~d~0 2) 0) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0)) (or (not (= (mod main_~p~0 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))))))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 07:32:00,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8611#(or (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (and (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (<= (+ main_~d~0 (div main_~d~0 2)) main_~r~0))) (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (<= (+ main_~d~0 (div main_~d~0 2) 1) main_~r~0)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))} is VALID [2022-04-15 07:32:00,926 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8255#true} {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #88#return; {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-15 07:32:00,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,927 INFO L272 TraceCheckUtils]: 69: Hoare triple {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,930 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8255#true} {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} #86#return; {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-15 07:32:00,930 INFO L290 TraceCheckUtils]: 67: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,930 INFO L272 TraceCheckUtils]: 64: Hoare triple {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !false; {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-15 07:32:00,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {8615#(and (or (and (or (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296) 1) main_~r~0)) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (mod main_~A~0 4294967296))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))))) (or (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (= (mod (+ (div main_~p~0 2) 1) 2) 0))) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (not (= (mod (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2) 0)))) (not (< main_~p~0 0)) (and (or (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))))) (= (mod main_~p~0 2) 0)) (or (and (or (not (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)) (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (not (= (mod (div main_~p~0 2) 2) 0)))) (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 1 (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0))) (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0 (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))) (and (not (= (mod (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2) 0)) (< (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))) (or (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-15 07:32:00,965 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8255#true} {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} #84#return; {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:32:00,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,966 INFO L272 TraceCheckUtils]: 57: Hoare triple {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,966 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8255#true} {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} #82#return; {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:32:00,966 INFO L290 TraceCheckUtils]: 55: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,966 INFO L290 TraceCheckUtils]: 53: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,966 INFO L272 TraceCheckUtils]: 52: Hoare triple {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,967 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8255#true} {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} #80#return; {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:32:00,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,967 INFO L272 TraceCheckUtils]: 47: Hoare triple {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} assume !false; {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:32:00,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8652#(or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) main_~r~0)) (< main_~d~0 0) (not (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (= (+ (* (- 1) (div (* (mod main_~B~0 4294967296) (div main_~p~0 2)) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (* (mod main_~B~0 4294967296) (div main_~p~0 2)))) (mod main_~A~0 4294967296))) (or (not (< main_~p~0 0)) (not (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) 2)) main_~r~0 (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (* (- 1) (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (< main_~d~0 0) (not (<= (+ (div (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) 2) (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0)) (= (mod main_~p~0 2) 0))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:32:00,980 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8255#true} {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} #84#return; {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} is VALID [2022-04-15 07:32:00,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,981 INFO L272 TraceCheckUtils]: 40: Hoare triple {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,981 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8255#true} {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} #82#return; {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} is VALID [2022-04-15 07:32:00,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,982 INFO L272 TraceCheckUtils]: 35: Hoare triple {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,982 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8255#true} {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} #80#return; {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} is VALID [2022-04-15 07:32:00,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:00,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:00,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:00,982 INFO L272 TraceCheckUtils]: 30: Hoare triple {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:00,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} assume !false; {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} is VALID [2022-04-15 07:32:01,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8704#(or (not (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296)) 2)) (* (- 1) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))) main_~r~0 (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (div (div (* main_~p~0 2) 2) 2) main_~q~0)))) (not (<= (+ (* main_~p~0 (mod main_~B~0 4294967296)) (div (* main_~p~0 (mod main_~B~0 4294967296)) 2)) main_~r~0)))} is VALID [2022-04-15 07:32:01,226 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8255#true} {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} #84#return; {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} is VALID [2022-04-15 07:32:01,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:01,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:01,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:01,226 INFO L272 TraceCheckUtils]: 23: Hoare triple {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:01,227 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8255#true} {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} #82#return; {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} is VALID [2022-04-15 07:32:01,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:01,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:01,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:01,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:01,228 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8255#true} {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} #80#return; {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} is VALID [2022-04-15 07:32:01,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:01,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:01,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:01,228 INFO L272 TraceCheckUtils]: 13: Hoare triple {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:01,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} assume !false; {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} is VALID [2022-04-15 07:32:01,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {8255#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8756#(or (<= (* main_~d~0 4) main_~r~0) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296))) (* (+ (div (* main_~p~0 4) 2) main_~q~0 (div (div (* main_~p~0 4) 2) 2)) (mod main_~B~0 4294967296)) (* (- 1) (div (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) 2)))) (not (<= (* 3 (* main_~p~0 (mod main_~B~0 4294967296))) main_~r~0)) (not (= (* (div (* main_~p~0 4) 2) (mod main_~B~0 4294967296)) (div (* main_~d~0 4) 2))))} is VALID [2022-04-15 07:32:01,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8255#true} {8255#true} #78#return; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {8255#true} assume !(0 == ~cond); {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {8255#true} ~cond := #in~cond; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {8255#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#true} call #t~ret6 := main(); {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8255#true} {8255#true} #94#return; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#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(10, 2);call #Ultimate.allocInit(12, 3); {8255#true} is VALID [2022-04-15 07:32:01,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {8255#true} call ULTIMATE.init(); {8255#true} is VALID [2022-04-15 07:32:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 61 proven. 19 refuted. 0 times theorem prover too weak. 276 trivial. 6 not checked. [2022-04-15 07:32:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:32:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334079755] [2022-04-15 07:32:01,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:32:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140949241] [2022-04-15 07:32:01,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140949241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:32:01,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:32:01,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-04-15 07:32:01,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:32:01,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488213362] [2022-04-15 07:32:01,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488213362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:32:01,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:32:01,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:32:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384073435] [2022-04-15 07:32:01,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:32:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 94 [2022-04-15 07:32:01,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:32:01,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 07:32:01,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:01,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:32:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:32:01,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:32:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=448, Unknown=1, NotChecked=44, Total=600 [2022-04-15 07:32:01,326 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 07:32:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:14,004 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2022-04-15 07:32:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:32:14,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 94 [2022-04-15 07:32:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:32:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 07:32:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-04-15 07:32:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 07:32:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-04-15 07:32:14,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2022-04-15 07:32:14,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:14,607 INFO L225 Difference]: With dead ends: 181 [2022-04-15 07:32:14,607 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 07:32:14,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=120, Invalid=533, Unknown=1, NotChecked=48, Total=702 [2022-04-15 07:32:14,609 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:32:14,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 246 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-04-15 07:32:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 07:32:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-04-15 07:32:14,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:32:14,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 07:32:14,734 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 07:32:14,735 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 07:32:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:14,739 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-04-15 07:32:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2022-04-15 07:32:14,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:32:14,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:32:14,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 151 states. [2022-04-15 07:32:14,739 INFO L87 Difference]: Start difference. First operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 151 states. [2022-04-15 07:32:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:14,744 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-04-15 07:32:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2022-04-15 07:32:14,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:32:14,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:32:14,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:32:14,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:32:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 99 states have internal predecessors, (101), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 07:32:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 174 transitions. [2022-04-15 07:32:14,749 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 174 transitions. Word has length 94 [2022-04-15 07:32:14,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:32:14,749 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 174 transitions. [2022-04-15 07:32:14,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-15 07:32:14,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 174 transitions. [2022-04-15 07:32:15,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2022-04-15 07:32:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 07:32:15,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:32:15,023 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:32:15,039 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:32:15,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:32:15,227 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:32:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:32:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -321511332, now seen corresponding path program 11 times [2022-04-15 07:32:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:32:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670510564] [2022-04-15 07:32:22,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:32:22,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:32:22,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:32:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash -321511332, now seen corresponding path program 12 times [2022-04-15 07:32:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:32:22,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674469555] [2022-04-15 07:32:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:32:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:32:22,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:32:22,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824081394] [2022-04-15 07:32:22,286 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:32:22,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:32:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:32:22,287 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:32:22,295 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:32:22,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 07:32:22,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:32:22,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:32:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:32:22,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:32:24,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {9813#true} call ULTIMATE.init(); {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {9813#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(10, 2);call #Ultimate.allocInit(12, 3); {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9813#true} {9813#true} #94#return; {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {9813#true} call #t~ret6 := main(); {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {9813#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {9813#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9813#true} {9813#true} #78#return; {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {9813#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {9851#(= main_~q~0 0)} assume !false; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,136 INFO L272 TraceCheckUtils]: 13: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,137 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #80#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,137 INFO L272 TraceCheckUtils]: 18: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,138 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #82#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,138 INFO L272 TraceCheckUtils]: 23: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,138 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #84#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {9851#(= main_~q~0 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {9851#(= main_~q~0 0)} assume !false; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,139 INFO L272 TraceCheckUtils]: 30: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,139 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #80#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,139 INFO L272 TraceCheckUtils]: 35: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #82#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,140 INFO L272 TraceCheckUtils]: 40: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,141 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #84#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {9851#(= main_~q~0 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {9851#(= main_~q~0 0)} assume !false; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,141 INFO L272 TraceCheckUtils]: 47: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #80#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,142 INFO L272 TraceCheckUtils]: 52: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,143 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9813#true} {9851#(= main_~q~0 0)} #82#return; {9851#(= main_~q~0 0)} is VALID [2022-04-15 07:32:24,143 INFO L272 TraceCheckUtils]: 57: Hoare triple {9851#(= main_~q~0 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,143 INFO L290 TraceCheckUtils]: 58: Hoare triple {9813#true} ~cond := #in~cond; {9993#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:24,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {9993#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:24,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:24,145 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} {9851#(= main_~q~0 0)} #84#return; {10004#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 07:32:24,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {10004#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,490 INFO L272 TraceCheckUtils]: 64: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,491 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9813#true} {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,491 INFO L272 TraceCheckUtils]: 69: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,492 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9813#true} {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,492 INFO L272 TraceCheckUtils]: 74: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,492 INFO L290 TraceCheckUtils]: 76: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,492 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9813#true} {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,493 INFO L290 TraceCheckUtils]: 79: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,493 INFO L290 TraceCheckUtils]: 80: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,493 INFO L272 TraceCheckUtils]: 81: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,493 INFO L290 TraceCheckUtils]: 82: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,493 INFO L290 TraceCheckUtils]: 83: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,494 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9813#true} {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #86#return; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,494 INFO L272 TraceCheckUtils]: 86: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,494 INFO L290 TraceCheckUtils]: 87: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,494 INFO L290 TraceCheckUtils]: 88: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,494 INFO L290 TraceCheckUtils]: 89: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,495 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9813#true} {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #88#return; {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-15 07:32:24,811 INFO L290 TraceCheckUtils]: 91: Hoare triple {10008#(and (= (* 2 (* (div (- main_~p~0) (- 2)) (mod main_~B~0 4294967296))) main_~d~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); {10004#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 07:32:24,811 INFO L290 TraceCheckUtils]: 92: Hoare triple {10004#(and (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:24,812 INFO L290 TraceCheckUtils]: 93: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:24,812 INFO L272 TraceCheckUtils]: 94: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:24,812 INFO L290 TraceCheckUtils]: 95: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:24,812 INFO L290 TraceCheckUtils]: 96: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:24,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:24,813 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9813#true} {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:24,813 INFO L272 TraceCheckUtils]: 99: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10121#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:32:24,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {10121#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10125#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:24,814 INFO L290 TraceCheckUtils]: 101: Hoare triple {10125#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9814#false} is VALID [2022-04-15 07:32:24,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {9814#false} assume !false; {9814#false} is VALID [2022-04-15 07:32:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 70 proven. 22 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2022-04-15 07:32:24,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:32:52,421 INFO L290 TraceCheckUtils]: 102: Hoare triple {9814#false} assume !false; {9814#false} is VALID [2022-04-15 07:32:52,422 INFO L290 TraceCheckUtils]: 101: Hoare triple {10125#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9814#false} is VALID [2022-04-15 07:32:52,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {10121#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10125#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:52,422 INFO L272 TraceCheckUtils]: 99: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10121#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:32:52,423 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {9813#true} {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:52,423 INFO L290 TraceCheckUtils]: 97: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,423 INFO L290 TraceCheckUtils]: 96: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,423 INFO L290 TraceCheckUtils]: 95: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,423 INFO L272 TraceCheckUtils]: 94: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,423 INFO L290 TraceCheckUtils]: 93: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !false; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:52,424 INFO L290 TraceCheckUtils]: 92: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:52,487 INFO L290 TraceCheckUtils]: 91: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (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); {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:52,488 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9813#true} {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #88#return; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,488 INFO L290 TraceCheckUtils]: 89: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,488 INFO L290 TraceCheckUtils]: 88: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,488 INFO L290 TraceCheckUtils]: 87: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,488 INFO L272 TraceCheckUtils]: 86: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,489 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9813#true} {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #86#return; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,489 INFO L290 TraceCheckUtils]: 84: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,489 INFO L290 TraceCheckUtils]: 83: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,489 INFO L290 TraceCheckUtils]: 82: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,489 INFO L272 TraceCheckUtils]: 81: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,494 INFO L290 TraceCheckUtils]: 80: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !false; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !(~r~0 >= ~d~0); {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,496 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9813#true} {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #84#return; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,496 INFO L272 TraceCheckUtils]: 74: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,498 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9813#true} {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #82#return; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,499 INFO L290 TraceCheckUtils]: 71: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,499 INFO L272 TraceCheckUtils]: 69: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,499 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9813#true} {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #80#return; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,500 INFO L272 TraceCheckUtils]: 64: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !false; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10165#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 07:32:52,505 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} {9813#true} #84#return; {10099#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 07:32:52,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:52,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {10265#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9997#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {9813#true} ~cond := #in~cond; {10265#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:32:52,506 INFO L272 TraceCheckUtils]: 57: Hoare triple {9813#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9813#true} {9813#true} #82#return; {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L272 TraceCheckUtils]: 52: Hoare triple {9813#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9813#true} {9813#true} #80#return; {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L272 TraceCheckUtils]: 47: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {9813#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9813#true} {9813#true} #84#return; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L272 TraceCheckUtils]: 40: Hoare triple {9813#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9813#true} {9813#true} #82#return; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L272 TraceCheckUtils]: 35: Hoare triple {9813#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,507 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9813#true} {9813#true} #80#return; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L272 TraceCheckUtils]: 30: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {9813#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9813#true} {9813#true} #84#return; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L272 TraceCheckUtils]: 23: Hoare triple {9813#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9813#true} {9813#true} #82#return; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L272 TraceCheckUtils]: 18: Hoare triple {9813#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9813#true} {9813#true} #80#return; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L272 TraceCheckUtils]: 13: Hoare triple {9813#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {9813#true} assume !false; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {9813#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9813#true} {9813#true} #78#return; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {9813#true} assume !(0 == ~cond); {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {9813#true} ~cond := #in~cond; {9813#true} is VALID [2022-04-15 07:32:52,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {9813#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {9813#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {9813#true} call #t~ret6 := main(); {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9813#true} {9813#true} #94#return; {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {9813#true} assume true; {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {9813#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(10, 2);call #Ultimate.allocInit(12, 3); {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {9813#true} call ULTIMATE.init(); {9813#true} is VALID [2022-04-15 07:32:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 69 proven. 23 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2022-04-15 07:32:52,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:32:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674469555] [2022-04-15 07:32:52,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:32:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824081394] [2022-04-15 07:32:52,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824081394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:32:52,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:32:52,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-15 07:32:52,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:32:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670510564] [2022-04-15 07:32:52,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670510564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:32:52,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:32:52,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:32:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664885867] [2022-04-15 07:32:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:32:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-04-15 07:32:52,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:32:52,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 07:32:53,530 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:32:53,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:32:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:32:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:32:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:32:53,531 INFO L87 Difference]: Start difference. First operand 151 states and 174 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 07:32:58,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:33:02,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:33:14,236 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:33:15,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:33:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:33:22,917 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2022-04-15 07:33:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:33:22,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-04-15 07:33:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:33:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 07:33:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-15 07:33:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 07:33:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-15 07:33:22,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-15 07:33:26,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:33:26,233 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:33:26,233 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 07:33:26,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:33:26,233 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:33:26,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 226 Invalid, 1 Unknown, 0 Unchecked, 14.7s Time] [2022-04-15 07:33:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 07:33:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2022-04-15 07:33:26,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:33:26,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 07:33:26,387 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 07:33:26,387 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 07:33:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:33:26,390 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-04-15 07:33:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2022-04-15 07:33:26,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:33:26,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:33:26,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) Second operand 161 states. [2022-04-15 07:33:26,390 INFO L87 Difference]: Start difference. First operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) Second operand 161 states. [2022-04-15 07:33:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:33:26,393 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2022-04-15 07:33:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2022-04-15 07:33:26,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:33:26,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:33:26,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:33:26,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:33:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 105 states have internal predecessors, (107), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 07:33:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2022-04-15 07:33:26,398 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 103 [2022-04-15 07:33:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:33:26,398 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2022-04-15 07:33:26,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 07:33:26,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 182 transitions. [2022-04-15 07:33:28,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 181 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:33:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2022-04-15 07:33:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 07:33:28,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:33:28,716 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, 1, 1, 1, 1, 1, 1] [2022-04-15 07:33:28,731 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:33:28,931 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,SelfDestructingSolverStorable12 [2022-04-15 07:33:28,931 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:33:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:33:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1306280540, now seen corresponding path program 3 times [2022-04-15 07:33:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:33:28,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965663208] [2022-04-15 07:33:36,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:33:36,826 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 07:33:36,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:33:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1306280540, now seen corresponding path program 4 times [2022-04-15 07:33:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:33:36,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644092773] [2022-04-15 07:33:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:33:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:33:36,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:33:36,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187686778] [2022-04-15 07:33:36,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:33:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:33:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:33:36,835 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:33:36,836 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:33:36,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:33:36,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:33:36,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 07:33:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:33:36,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:34:14,079 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:34:18,363 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:34:20,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {11414#true} call ULTIMATE.init(); {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {11414#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(10, 2);call #Ultimate.allocInit(12, 3); {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11414#true} {11414#true} #94#return; {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {11414#true} call #t~ret6 := main(); {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {11414#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {11414#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11414#true} {11414#true} #78#return; {11414#true} is VALID [2022-04-15 07:34:20,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {11414#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11414#true} {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #80#return; {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,811 INFO L272 TraceCheckUtils]: 18: Hoare triple {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11414#true} {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,813 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11414#true} {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {11452#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:34:20,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !false; {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:34:20,814 INFO L272 TraceCheckUtils]: 30: Hoare triple {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11414#true} {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:34:20,815 INFO L272 TraceCheckUtils]: 35: Hoare triple {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,816 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11414#true} {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:34:20,816 INFO L272 TraceCheckUtils]: 40: Hoare triple {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,824 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11414#true} {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 07:34:20,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {11504#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !false; {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,827 INFO L272 TraceCheckUtils]: 47: Hoare triple {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,828 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11414#true} {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #80#return; {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,828 INFO L272 TraceCheckUtils]: 52: Hoare triple {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,828 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11414#true} {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,828 INFO L272 TraceCheckUtils]: 57: Hoare triple {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,829 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11414#true} {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {11556#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !false; {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,830 INFO L272 TraceCheckUtils]: 64: Hoare triple {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,831 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11414#true} {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,831 INFO L272 TraceCheckUtils]: 69: Hoare triple {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,831 INFO L290 TraceCheckUtils]: 72: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,832 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11414#true} {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 07:34:20,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {11608#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~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); {11645#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 07:34:20,836 INFO L290 TraceCheckUtils]: 75: Hoare triple {11645#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0) (<= main_~d~0 main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} is VALID [2022-04-15 07:34:20,836 INFO L290 TraceCheckUtils]: 76: Hoare triple {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} assume !false; {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} is VALID [2022-04-15 07:34:20,836 INFO L272 TraceCheckUtils]: 77: Hoare triple {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,836 INFO L290 TraceCheckUtils]: 78: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,836 INFO L290 TraceCheckUtils]: 79: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,836 INFO L290 TraceCheckUtils]: 80: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,837 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11414#true} {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} #86#return; {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} is VALID [2022-04-15 07:34:20,837 INFO L272 TraceCheckUtils]: 82: Hoare triple {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,837 INFO L290 TraceCheckUtils]: 83: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:34:20,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:34:20,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:34:20,838 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11414#true} {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} #88#return; {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0))} is VALID [2022-04-15 07:34:20,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {11649#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= main_~p~0 2) (= (mod (div (* (- 2) main_~d~0) (- 2)) 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); {11686#(and (= main_~q~0 2) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2)) (- 2)) 2) 0) (<= 0 main_~r~0) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (< (* main_~r~0 2) (mod main_~A~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,845 INFO L290 TraceCheckUtils]: 88: Hoare triple {11686#(and (= main_~q~0 2) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2)) (- 2)) 2) 0) (<= 0 main_~r~0) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (< (* main_~r~0 2) (mod main_~A~0 4294967296)) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} assume !false; {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,846 INFO L272 TraceCheckUtils]: 90: Hoare triple {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {11414#true} ~cond := #in~cond; {11700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:34:20,846 INFO L290 TraceCheckUtils]: 92: Hoare triple {11700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:20,847 INFO L290 TraceCheckUtils]: 93: Hoare triple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:20,848 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} #86#return; {11711#(and (= (+ main_~p~0 2) main_~q~0) (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,848 INFO L272 TraceCheckUtils]: 95: Hoare triple {11711#(and (= (+ main_~p~0 2) main_~q~0) (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:34:20,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {11414#true} ~cond := #in~cond; {11700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:34:20,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {11700#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:20,848 INFO L290 TraceCheckUtils]: 98: Hoare triple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:20,850 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} {11711#(and (= (+ main_~p~0 2) main_~q~0) (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= main_~p~0 1))} #88#return; {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-15 07:34:20,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {11690#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= 2 (+ main_~q~0 (* (- 1) main_~p~0))) (= main_~p~0 1))} assume !(1 != ~p~0); {11730#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-15 07:34:20,852 INFO L272 TraceCheckUtils]: 101: Hoare triple {11730#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 (+ main_~d~0 main_~r~0)) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (+ (- 2) main_~q~0) 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:34:20,853 INFO L290 TraceCheckUtils]: 102: Hoare triple {11734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:34:20,853 INFO L290 TraceCheckUtils]: 103: Hoare triple {11738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11415#false} is VALID [2022-04-15 07:34:20,853 INFO L290 TraceCheckUtils]: 104: Hoare triple {11415#false} assume !false; {11415#false} is VALID [2022-04-15 07:34:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 106 proven. 30 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-04-15 07:34:20,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:35:13,120 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:35:17,431 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:35:33,724 INFO L290 TraceCheckUtils]: 104: Hoare triple {11415#false} assume !false; {11415#false} is VALID [2022-04-15 07:35:33,725 INFO L290 TraceCheckUtils]: 103: Hoare triple {11738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11415#false} is VALID [2022-04-15 07:35:33,725 INFO L290 TraceCheckUtils]: 102: Hoare triple {11734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:35:33,726 INFO L272 TraceCheckUtils]: 101: Hoare triple {11754#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:35:33,726 INFO L290 TraceCheckUtils]: 100: Hoare triple {11758#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {11754#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-15 07:35:33,727 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} {11762#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} #88#return; {11758#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:35:33,727 INFO L290 TraceCheckUtils]: 98: Hoare triple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:35:33,728 INFO L290 TraceCheckUtils]: 97: Hoare triple {11772#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:35:33,728 INFO L290 TraceCheckUtils]: 96: Hoare triple {11414#true} ~cond := #in~cond; {11772#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:35:33,728 INFO L272 TraceCheckUtils]: 95: Hoare triple {11762#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,731 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} {11414#true} #86#return; {11762#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} is VALID [2022-04-15 07:35:33,731 INFO L290 TraceCheckUtils]: 93: Hoare triple {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:35:33,731 INFO L290 TraceCheckUtils]: 92: Hoare triple {11772#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11704#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 91: Hoare triple {11414#true} ~cond := #in~cond; {11772#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:35:33,732 INFO L272 TraceCheckUtils]: 90: Hoare triple {11414#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {11414#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {11414#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); {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {11414#true} {11414#true} #88#return; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 85: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L272 TraceCheckUtils]: 82: Hoare triple {11414#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {11414#true} {11414#true} #86#return; {11414#true} is VALID [2022-04-15 07:35:33,732 INFO L290 TraceCheckUtils]: 80: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L272 TraceCheckUtils]: 77: Hoare triple {11414#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 75: Hoare triple {11414#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {11414#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); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11414#true} {11414#true} #88#return; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 72: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L272 TraceCheckUtils]: 69: Hoare triple {11414#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11414#true} {11414#true} #86#return; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L272 TraceCheckUtils]: 64: Hoare triple {11414#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {11414#true} assume !(~r~0 >= ~d~0); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11414#true} {11414#true} #84#return; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L272 TraceCheckUtils]: 57: Hoare triple {11414#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11414#true} {11414#true} #82#return; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L272 TraceCheckUtils]: 52: Hoare triple {11414#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,734 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11414#true} {11414#true} #80#return; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L272 TraceCheckUtils]: 47: Hoare triple {11414#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {11414#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11414#true} {11414#true} #84#return; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L272 TraceCheckUtils]: 40: Hoare triple {11414#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11414#true} {11414#true} #82#return; {11414#true} is VALID [2022-04-15 07:35:33,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L272 TraceCheckUtils]: 35: Hoare triple {11414#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11414#true} {11414#true} #80#return; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L272 TraceCheckUtils]: 30: Hoare triple {11414#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {11414#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11414#true} {11414#true} #84#return; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,736 INFO L272 TraceCheckUtils]: 23: Hoare triple {11414#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {11414#true} {11414#true} #82#return; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L272 TraceCheckUtils]: 18: Hoare triple {11414#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11414#true} {11414#true} #80#return; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L272 TraceCheckUtils]: 13: Hoare triple {11414#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {11414#true} assume !false; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {11414#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11414#true} {11414#true} #78#return; {11414#true} is VALID [2022-04-15 07:35:33,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {11414#true} assume !(0 == ~cond); {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {11414#true} ~cond := #in~cond; {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {11414#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {11414#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {11414#true} call #t~ret6 := main(); {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11414#true} {11414#true} #94#return; {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {11414#true} assume true; {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {11414#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(10, 2);call #Ultimate.allocInit(12, 3); {11414#true} is VALID [2022-04-15 07:35:33,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {11414#true} call ULTIMATE.init(); {11414#true} is VALID [2022-04-15 07:35:33,738 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:35:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:35:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644092773] [2022-04-15 07:35:33,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:35:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187686778] [2022-04-15 07:35:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187686778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:35:33,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:35:33,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2022-04-15 07:35:33,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:35:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965663208] [2022-04-15 07:35:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965663208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:35:33,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:35:33,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:35:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12146675] [2022-04-15 07:35:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:35:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 105 [2022-04-15 07:35:33,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:35:33,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-04-15 07:35:33,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:33,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:35:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:35:33,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:35:33,935 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17)