/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:21:48,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:21:48,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:21:48,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:21:48,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:21:48,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:21:48,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:21:48,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:21:48,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:21:48,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:21:48,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:21:48,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:21:48,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:21:48,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:21:48,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:21:48,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:21:48,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:21:48,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:21:48,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:21:48,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:21:48,117 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:21:48,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:21:48,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:21:48,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:21:48,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:21:48,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:21:48,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:21:48,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:21:48,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:21:48,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:21:48,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:21:48,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:21:48,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:21:48,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:21:48,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:21:48,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:21:48,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:21:48,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:21:48,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:21:48,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:21:48,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:21:48,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:21:48,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:21:48,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:21:48,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:21:48,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:21:48,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:21:48,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:21:48,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:21:48,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:21:48,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:21:48,143 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:21:48,143 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:21:48,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:21:48,143 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:21:48,143 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-28 13:21:48,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:21:48,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:21:48,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:21:48,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:21:48,380 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:21:48,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c [2022-04-28 13:21:48,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ab0d4c7/5f3a44181dca4bdf99feaab03e692525/FLAGf462cf860 [2022-04-28 13:21:48,784 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:21:48,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c [2022-04-28 13:21:48,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ab0d4c7/5f3a44181dca4bdf99feaab03e692525/FLAGf462cf860 [2022-04-28 13:21:48,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48ab0d4c7/5f3a44181dca4bdf99feaab03e692525 [2022-04-28 13:21:48,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:21:48,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:21:48,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:21:48,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:21:48,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:21:48,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:21:48" (1/1) ... [2022-04-28 13:21:48,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a936376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:48, skipping insertion in model container [2022-04-28 13:21:48,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:21:48" (1/1) ... [2022-04-28 13:21:48,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:21:48,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:21:48,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c[526,539] [2022-04-28 13:21:48,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:21:48,975 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:21:48,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound50.c[526,539] [2022-04-28 13:21:48,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:21:49,008 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:21:49,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49 WrapperNode [2022-04-28 13:21:49,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:21:49,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:21:49,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:21:49,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:21:49,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:21:49,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:21:49,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:21:49,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:21:49,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (1/1) ... [2022-04-28 13:21:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:21:49,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:21:49,073 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-28 13:21:49,116 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-28 13:21:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:21:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:21:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:21:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:21:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:21:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:21:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:21:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:21:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:21:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:21:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:21:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:21:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:21:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:21:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:21:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:21:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:21:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:21:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:21:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:21:49,190 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:21:49,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:21:49,292 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:21:49,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:21:49,317 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 13:21:49,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:21:49 BoogieIcfgContainer [2022-04-28 13:21:49,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:21:49,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:21:49,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:21:49,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:21:49,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:21:48" (1/3) ... [2022-04-28 13:21:49,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad1e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:21:49, skipping insertion in model container [2022-04-28 13:21:49,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:21:49" (2/3) ... [2022-04-28 13:21:49,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad1e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:21:49, skipping insertion in model container [2022-04-28 13:21:49,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:21:49" (3/3) ... [2022-04-28 13:21:49,324 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound50.c [2022-04-28 13:21:49,350 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:21:49,350 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:21:49,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:21:49,389 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1810fcd7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52b8e072 [2022-04-28 13:21:49,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:21:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:21:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 13:21:49,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:49,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:49,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-28 13:21:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:49,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94248589] [2022-04-28 13:21:49,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-28 13:21:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:49,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227381781] [2022-04-28 13:21:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:21:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:49,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 13:21:49,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 13:21:49,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 13:21:49,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:21:49,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 13:21:49,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 13:21:49,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 13:21:49,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-28 13:21:49,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-28 13:21:49,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 13:21:49,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-28 13:21:49,582 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-28 13:21:49,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 13:21:49,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 13:21:49,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 13:21:49,584 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-28 13:21:49,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:49,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227381781] [2022-04-28 13:21:49,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227381781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:49,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:49,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:21:49,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94248589] [2022-04-28 13:21:49,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94248589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:49,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:49,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:21:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981635714] [2022-04-28 13:21:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:49,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:21:49,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:49,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:49,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:21:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:21:49,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:21:49,638 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:49,807 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-28 13:21:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:21:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:21:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 13:21:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 13:21:49,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 13:21:49,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:49,908 INFO L225 Difference]: With dead ends: 57 [2022-04-28 13:21:49,908 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 13:21:49,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:21:49,913 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:49,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:21:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 13:21:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 13:21:49,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:49,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:49,993 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:49,993 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,009 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 13:21:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 13:21:50,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 13:21:50,011 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 13:21:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,015 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 13:21:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 13:21:50,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:50,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-28 13:21:50,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-28 13:21:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:50,019 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-28 13:21:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-28 13:21:50,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-28 13:21:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 13:21:50,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:50,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:50,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:21:50,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-28 13:21:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605542305] [2022-04-28 13:21:50,052 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:50,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-28 13:21:50,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:50,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261250499] [2022-04-28 13:21:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:21:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 13:21:50,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 13:21:50,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 13:21:50,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:21:50,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 13:21:50,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 13:21:50,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 13:21:50,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-28 13:21:50,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:21:50,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:21:50,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 50);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 13:21:50,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:21:50,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:21:50,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-28 13:21:50,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 13:21:50,181 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-28 13:21:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:50,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261250499] [2022-04-28 13:21:50,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261250499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:21:50,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:50,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1605542305] [2022-04-28 13:21:50,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1605542305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:21:50,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893669187] [2022-04-28 13:21:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:50,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:21:50,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:50,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:21:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:21:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:21:50,211 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,492 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 13:21:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:21:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 13:21:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:21:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:21:50,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 13:21:50,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,542 INFO L225 Difference]: With dead ends: 41 [2022-04-28 13:21:50,542 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 13:21:50,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:21:50,544 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:50,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:21:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 13:21:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-28 13:21:50,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:50,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,550 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,551 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,553 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 13:21:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 13:21:50,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 13:21:50,554 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 13:21:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,557 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 13:21:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 13:21:50,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:50,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-28 13:21:50,559 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-28 13:21:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:50,559 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-28 13:21:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-28 13:21:50,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 13:21:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 13:21:50,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:50,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:50,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 13:21:50,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-28 13:21:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213183251] [2022-04-28 13:21:50,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-28 13:21:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:50,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171665978] [2022-04-28 13:21:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:21:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:21:50,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:50,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-28 13:21:50,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {502#false} is VALID [2022-04-28 13:21:50,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-28 13:21:50,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 50);havoc #t~post6; {502#false} is VALID [2022-04-28 13:21:50,658 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-28 13:21:50,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-28 13:21:50,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-28 13:21:50,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 13:21:50,659 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-28 13:21:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:50,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171665978] [2022-04-28 13:21:50,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171665978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:21:50,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:50,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213183251] [2022-04-28 13:21:50,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213183251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:21:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100034139] [2022-04-28 13:21:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 13:21:50,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:50,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:21:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:21:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:21:50,671 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,808 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 13:21:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:21:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 13:21:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 13:21:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 13:21:50,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 13:21:50,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:50,851 INFO L225 Difference]: With dead ends: 46 [2022-04-28 13:21:50,851 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 13:21:50,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:21:50,852 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:50,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:21:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 13:21:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 13:21:50,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:50,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,861 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,861 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,863 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 13:21:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:21:50,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 13:21:50,864 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 13:21:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:50,865 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 13:21:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:21:50,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:50,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:50,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:50,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 13:21:50,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 13:21:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:50,868 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 13:21:50,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 13:21:50,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 13:21:50,897 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-28 13:21:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 13:21:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 13:21:50,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:50,898 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:50,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 13:21:50,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-28 13:21:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724484658] [2022-04-28 13:21:50,899 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-28 13:21:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:50,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147733333] [2022-04-28 13:21:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:21:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 13:21:50,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:21:50,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 13:21:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 13:21:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:50,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 13:21:50,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 13:21:50,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:21:50,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:21:50,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:21:50,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 13:21:50,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:21:50,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 13:21:50,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-28 13:21:50,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:21:50,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:21:50,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 50);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:21:50,952 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-28 13:21:50,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 13:21:50,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 13:21:50,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 13:21:50,954 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:21:50,955 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:21:50,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:21:50,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-28 13:21:50,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 13:21:50,956 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-28 13:21:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:50,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147733333] [2022-04-28 13:21:50,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147733333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:21:50,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:50,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724484658] [2022-04-28 13:21:50,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724484658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:50,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:50,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:21:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117808015] [2022-04-28 13:21:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:50,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 13:21:50,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:50,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:21:50,973 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-28 13:21:50,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:21:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:21:50,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:21:50,974 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:21:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,200 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-28 13:21:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:21:51,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 13:21:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:21:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:21:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:21:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 13:21:51,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 13:21:51,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:51,248 INFO L225 Difference]: With dead ends: 46 [2022-04-28 13:21:51,248 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 13:21:51,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:21:51,254 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:51,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:21:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 13:21:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-28 13:21:51,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:51,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:51,272 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:51,274 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,277 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 13:21:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 13:21:51,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:51,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:51,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 13:21:51,278 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 13:21:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,280 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 13:21:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 13:21:51,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:51,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:51,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:51,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:21:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 13:21:51,281 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-28 13:21:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:51,282 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 13:21:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 13:21:51,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 13:21:51,315 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-28 13:21:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 13:21:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 13:21:51,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:51,316 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:51,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 13:21:51,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-28 13:21:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:51,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992920073] [2022-04-28 13:21:51,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-28 13:21:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287877049] [2022-04-28 13:21:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:51,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:21:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025421841] [2022-04-28 13:21:51,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:21:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:21:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:21:51,343 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-28 13:21:51,346 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-28 13:21:51,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:21:51,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:21:51,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:21:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:51,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:21:51,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-28 13:21:51,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-28 13:21:51,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:21:51,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-28 13:21:51,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-28 13:21:51,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:21:51,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:21:51,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:21:51,542 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 13:21:51,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 13:21:51,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 13:21:51,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:21:51,543 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:21:51,543 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 13:21:51,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 13:21:51,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 13:21:51,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 13:21:51,544 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:21:51,545 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:21:51,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:21:51,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-28 13:21:51,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-28 13:21:51,546 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-28 13:21:51,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:21:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:51,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287877049] [2022-04-28 13:21:51,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:21:51,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025421841] [2022-04-28 13:21:51,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025421841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:51,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992920073] [2022-04-28 13:21:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992920073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141090527] [2022-04-28 13:21:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:51,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:21:51,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:51,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:21:51,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:21:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:21:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:21:51,576 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:21:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,719 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 13:21:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:21:51,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:21:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:21:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 13:21:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:21:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 13:21:51,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-28 13:21:51,773 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-28 13:21:51,774 INFO L225 Difference]: With dead ends: 65 [2022-04-28 13:21:51,774 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 13:21:51,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:21:51,776 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:51,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:21:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 13:21:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 13:21:51,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:51,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:51,794 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:51,794 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:51,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,796 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 13:21:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:21:51,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:51,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:51,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 13:21:51,797 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 13:21:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:51,802 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 13:21:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:21:51,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:51,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:51,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:51,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 13:21:51,806 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-28 13:21:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:51,806 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 13:21:51,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:21:51,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 13:21:51,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 13:21:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 13:21:51,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:51,850 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:51,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 13:21:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:21:52,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-28 13:21:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:52,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245783654] [2022-04-28 13:21:52,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-28 13:21:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:52,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863504280] [2022-04-28 13:21:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:52,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:21:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310938237] [2022-04-28 13:21:52,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:21:52,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:21:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:21:52,081 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-28 13:21:52,102 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-28 13:21:52,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:21:52,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:21:52,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:21:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:52,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:21:52,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-28 13:21:52,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:52,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:52,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:52,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:52,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 13:21:52,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,313 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,315 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,316 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,320 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 13:21:52,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:21:52,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1411#false} is VALID [2022-04-28 13:21:52,330 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-28 13:21:52,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-28 13:21:52,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-28 13:21:52,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-28 13:21:52,331 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-28 13:21:52,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:21:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:52,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863504280] [2022-04-28 13:21:52,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:21:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310938237] [2022-04-28 13:21:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310938237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:52,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245783654] [2022-04-28 13:21:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245783654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11892111] [2022-04-28 13:21:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:21:52,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:52,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:52,348 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-28 13:21:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:21:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:21:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:21:52,353 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:52,443 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-28 13:21:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:21:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:21:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:21:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 13:21:52,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 13:21:52,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:52,482 INFO L225 Difference]: With dead ends: 70 [2022-04-28 13:21:52,482 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 13:21:52,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:21:52,483 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:52,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:21:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 13:21:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 13:21:52,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:52,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:52,511 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:52,511 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:52,513 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 13:21:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 13:21:52,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:52,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:52,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 13:21:52,515 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 13:21:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:52,516 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 13:21:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 13:21:52,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:52,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:52,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:52,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:21:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-28 13:21:52,519 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-28 13:21:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:52,520 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-28 13:21:52,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:52,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-28 13:21:52,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-28 13:21:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 13:21:52,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:52,574 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:52,593 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-28 13:21:52,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 13:21:52,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-28 13:21:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:52,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496195881] [2022-04-28 13:21:52,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:21:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-28 13:21:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:21:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043227716] [2022-04-28 13:21:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:21:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:21:52,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:21:52,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416151945] [2022-04-28 13:21:52,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:21:52,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:21:52,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:21:52,819 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-28 13:21:52,835 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-28 13:21:52,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:21:52,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:21:52,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:21:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:21:52,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:21:56,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-28 13:21:56,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-28 13:21:56,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:21:56,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-28 13:21:56,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-28 13:21:56,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,731 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:21:56,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:21:56,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:21:56,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:21:56,732 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:21:56,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:21:56,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:21:56,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:21:56,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 13:21:56,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 13:21:56,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 13:21:56,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 13:21:56,734 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 13:21:56,736 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:21:56,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:21:56,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-28 13:21:56,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-28 13:21:56,737 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-28 13:21:56,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:21:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:21:56,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043227716] [2022-04-28 13:21:56,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:21:56,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416151945] [2022-04-28 13:21:56,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416151945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:56,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:56,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:56,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:21:56,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496195881] [2022-04-28 13:21:56,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496195881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:21:56,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:21:56,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:21:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975149756] [2022-04-28 13:21:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:21:56,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:21:56,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:21:56,739 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-28 13:21:56,755 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-28 13:21:56,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:21:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:56,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:21:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:21:56,755 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:56,913 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 13:21:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:21:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 13:21:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:21:56,913 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-28 13:21:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 13:21:56,914 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-28 13:21:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 13:21:56,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 13:21:56,974 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-28 13:21:56,975 INFO L225 Difference]: With dead ends: 76 [2022-04-28 13:21:56,975 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 13:21:56,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:21:56,975 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:21:56,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:21:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 13:21:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 13:21:57,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:21:57,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:21:57,006 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:21:57,006 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:21:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:57,008 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 13:21:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 13:21:57,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:57,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:57,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 13:21:57,009 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 13:21:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:21:57,010 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 13:21:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 13:21:57,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:21:57,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:21:57,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:21:57,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:21:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:21:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-28 13:21:57,012 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-28 13:21:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:21:57,012 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-28 13:21:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:21:57,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-28 13:21:57,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:21:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 13:21:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 13:21:57,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:21:57,102 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:21:57,133 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-28 13:21:57,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:21:57,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:21:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:21:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-28 13:21:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:21:57,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758863962] [2022-04-28 13:22:01,448 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:01,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-28 13:22:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:01,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55827845] [2022-04-28 13:22:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:01,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634424996] [2022-04-28 13:22:01,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:22:01,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:01,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:01,470 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-28 13:22:01,471 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-28 13:22:01,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:22:01,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:01,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:22:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:01,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:01,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 13:22:01,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:01,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:01,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:01,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:01,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:01,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,638 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,639 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,639 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,641 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,641 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,642 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:01,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-28 13:22:01,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 50);havoc #t~post6; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:22:01,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 13:22:01,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 13:22:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 13:22:01,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:01,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 13:22:01,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 13:22:01,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 13:22:01,780 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 13:22:01,781 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:22:01,781 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 50);havoc #t~post6; {2397#false} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 13:22:01,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2397#false} is VALID [2022-04-28 13:22:01,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:22:01,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,783 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #82#return; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:22:01,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:22:01,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:22:01,783 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:22:01,784 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #80#return; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:22:01,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:22:01,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:22:01,784 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:22:01,784 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 50)} #78#return; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 13:22:01,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 13:22:01,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 13:22:01,785 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 13:22:01,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 50)} is VALID [2022-04-28 13:22:01,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 49)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2604#(< ~counter~0 49)} is VALID [2022-04-28 13:22:01,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 49)} call #t~ret7 := main(); {2604#(< ~counter~0 49)} is VALID [2022-04-28 13:22:01,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 49)} {2396#true} #92#return; {2604#(< ~counter~0 49)} is VALID [2022-04-28 13:22:01,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 49)} assume true; {2604#(< ~counter~0 49)} is VALID [2022-04-28 13:22:01,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2604#(< ~counter~0 49)} is VALID [2022-04-28 13:22:01,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 13:22:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 13:22:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55827845] [2022-04-28 13:22:01,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634424996] [2022-04-28 13:22:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634424996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:22:01,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:22:01,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:22:01,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758863962] [2022-04-28 13:22:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758863962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:01,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:01,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:22:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59342382] [2022-04-28 13:22:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 13:22:01,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:01,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:22:01,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:01,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:22:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:22:01,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:22:01,807 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:22:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:01,928 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 13:22:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:22:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 13:22:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:22:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 13:22:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:22:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 13:22:01,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 13:22:01,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:01,980 INFO L225 Difference]: With dead ends: 90 [2022-04-28 13:22:01,980 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 13:22:01,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:22:01,981 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:01,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:22:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 13:22:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 13:22:02,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:02,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:22:02,015 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:22:02,016 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:22:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:02,017 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 13:22:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:22:02,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:02,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:02,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 13:22:02,018 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 13:22:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:02,019 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 13:22:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:22:02,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:02,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:02,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:02,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:22:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-28 13:22:02,022 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-28 13:22:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:02,022 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-28 13:22:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 13:22:02,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-28 13:22:02,085 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-28 13:22:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 13:22:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 13:22:02,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:02,086 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:02,104 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-28 13:22:02,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:02,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-28 13:22:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:02,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354957423] [2022-04-28 13:22:04,419 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:04,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-28 13:22:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:04,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201494086] [2022-04-28 13:22:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:04,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:04,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782881083] [2022-04-28 13:22:04,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:22:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:04,427 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-28 13:22:04,428 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-28 13:22:04,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:22:04,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:04,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:22:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:04,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:04,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 13:22:04,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 13:22:04,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 13:22:04,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 13:22:04,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,656 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,657 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,658 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,658 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:04,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:22:04,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:22:04,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:22:04,660 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:22:04,661 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,662 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 13:22:04,663 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:04,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:04,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 13:22:04,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 13:22:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:22:04,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:04,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 13:22:04,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 13:22:04,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:04,812 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:04,812 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,813 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,813 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,813 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,818 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,819 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,819 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,820 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 13:22:04,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 13:22:04,820 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 13:22:04,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:22:04,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 13:22:04,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 13:22:04,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 13:22:04,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 13:22:04,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 13:22:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 13:22:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201494086] [2022-04-28 13:22:04,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782881083] [2022-04-28 13:22:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782881083] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 13:22:04,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 13:22:04,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 13:22:04,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354957423] [2022-04-28 13:22:04,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354957423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:04,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:04,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:22:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074492783] [2022-04-28 13:22:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 13:22:04,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:04,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:22:04,840 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-28 13:22:04,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:22:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:04,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:22:04,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:22:04,841 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:22:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:07,062 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 13:22:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:22:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 13:22:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:22:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:22:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:22:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 13:22:07,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 13:22:07,101 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-28 13:22:07,102 INFO L225 Difference]: With dead ends: 78 [2022-04-28 13:22:07,102 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 13:22:07,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:22:07,103 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:07,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:22:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 13:22:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-28 13:22:07,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:07,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:22:07,139 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:22:07,140 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:22:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:07,142 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 13:22:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 13:22:07,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:07,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:07,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 13:22:07,143 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 13:22:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:07,145 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 13:22:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 13:22:07,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:07,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:07,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:07,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:22:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 13:22:07,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-28 13:22:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:07,148 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 13:22:07,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 13:22:07,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-28 13:22:07,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 13:22:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 13:22:07,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:07,222 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:07,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 13:22:07,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:07,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:07,423 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-28 13:22:07,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:07,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179938956] [2022-04-28 13:22:10,364 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:10,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-28 13:22:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307516671] [2022-04-28 13:22:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:10,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:10,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6854762] [2022-04-28 13:22:10,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:22:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:10,373 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-28 13:22:10,374 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-28 13:22:10,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:22:10,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:10,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:22:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:10,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:10,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 13:22:10,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:10,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:10,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:10,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:10,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:10,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,642 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,643 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,644 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,645 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,646 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,649 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:10,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,651 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,652 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,653 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,654 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,655 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,659 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:10,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-28 13:22:10,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 13:22:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 13:22:10,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:10,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 13:22:10,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 13:22:10,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 13:22:10,897 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 13:22:10,897 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 13:22:10,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,897 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3770#false} is VALID [2022-04-28 13:22:10,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:22:10,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 50)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,900 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #82#return; {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,900 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,902 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #80#return; {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,902 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,903 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 50)} #78#return; {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,904 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 50)} is VALID [2022-04-28 13:22:10,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,908 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #82#return; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,908 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,908 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #80#return; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,909 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,909 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 49)} #78#return; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 13:22:10,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 13:22:10,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 13:22:10,910 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 13:22:10,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 49)} is VALID [2022-04-28 13:22:10,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4075#(< ~counter~0 48)} is VALID [2022-04-28 13:22:10,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 48)} call #t~ret7 := main(); {4075#(< ~counter~0 48)} is VALID [2022-04-28 13:22:10,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 48)} {3769#true} #92#return; {4075#(< ~counter~0 48)} is VALID [2022-04-28 13:22:10,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 48)} assume true; {4075#(< ~counter~0 48)} is VALID [2022-04-28 13:22:10,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4075#(< ~counter~0 48)} is VALID [2022-04-28 13:22:10,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 13:22:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 13:22:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307516671] [2022-04-28 13:22:10,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6854762] [2022-04-28 13:22:10,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6854762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:22:10,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:22:10,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:22:10,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:10,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179938956] [2022-04-28 13:22:10,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179938956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:10,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:10,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:22:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756805514] [2022-04-28 13:22:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 13:22:10,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:10,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:10,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:10,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:22:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:22:10,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:22:10,968 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:11,140 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 13:22:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:22:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 13:22:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 13:22:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 13:22:11,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-28 13:22:11,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:11,195 INFO L225 Difference]: With dead ends: 104 [2022-04-28 13:22:11,195 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 13:22:11,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:22:11,195 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:11,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:22:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 13:22:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 13:22:11,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:11,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:11,252 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:11,252 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:11,254 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 13:22:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 13:22:11,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:11,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:11,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 13:22:11,255 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 13:22:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:11,257 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 13:22:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 13:22:11,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:11,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:11,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:11,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-28 13:22:11,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-28 13:22:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:11,260 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-28 13:22:11,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:11,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-28 13:22:11,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-28 13:22:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 13:22:11,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:11,355 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:11,386 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-28 13:22:11,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:11,556 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-28 13:22:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154373331] [2022-04-28 13:22:15,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:15,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-28 13:22:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:15,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464653738] [2022-04-28 13:22:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:15,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726926647] [2022-04-28 13:22:15,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:22:15,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:15,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:15,675 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-28 13:22:15,680 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-28 13:22:15,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:22:15,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:15,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:22:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:15,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:15,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 13:22:15,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:15,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:15,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:15,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:15,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {4678#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:15,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {4678#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,994 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,995 INFO L272 TraceCheckUtils]: 13: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,996 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,997 INFO L272 TraceCheckUtils]: 18: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,999 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {4694#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4694#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:15,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {4694#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,000 INFO L272 TraceCheckUtils]: 26: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,002 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,002 INFO L272 TraceCheckUtils]: 31: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,003 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,004 INFO L272 TraceCheckUtils]: 36: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,005 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4749#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:16,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4804#(<= |main_#t~post5| 2)} is VALID [2022-04-28 13:22:16,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 50);havoc #t~post5; {4671#false} is VALID [2022-04-28 13:22:16,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 50);havoc #t~post6; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 13:22:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 13:22:16,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:16,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,248 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 50);havoc #t~post6; {4671#false} is VALID [2022-04-28 13:22:16,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-28 13:22:16,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {4671#false} is VALID [2022-04-28 13:22:16,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4874#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:22:16,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,250 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #82#return; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,250 INFO L272 TraceCheckUtils]: 36: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,251 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #80#return; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,251 INFO L272 TraceCheckUtils]: 31: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,252 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 50)} #78#return; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,252 INFO L272 TraceCheckUtils]: 26: Hoare triple {4878#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {4878#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4878#(< ~counter~0 50)} is VALID [2022-04-28 13:22:16,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {4933#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,255 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #82#return; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,255 INFO L272 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,259 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #80#return; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L272 TraceCheckUtils]: 13: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 49)} #78#return; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-28 13:22:16,260 INFO L272 TraceCheckUtils]: 8: Hoare triple {4933#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-28 13:22:16,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {4933#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(< ~counter~0 49)} is VALID [2022-04-28 13:22:16,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4988#(< ~counter~0 48)} is VALID [2022-04-28 13:22:16,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 48)} call #t~ret7 := main(); {4988#(< ~counter~0 48)} is VALID [2022-04-28 13:22:16,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 48)} {4670#true} #92#return; {4988#(< ~counter~0 48)} is VALID [2022-04-28 13:22:16,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 48)} assume true; {4988#(< ~counter~0 48)} is VALID [2022-04-28 13:22:16,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4988#(< ~counter~0 48)} is VALID [2022-04-28 13:22:16,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-28 13:22:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 13:22:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464653738] [2022-04-28 13:22:16,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726926647] [2022-04-28 13:22:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726926647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:22:16,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:22:16,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:22:16,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154373331] [2022-04-28 13:22:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154373331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:16,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:16,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:22:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818406224] [2022-04-28 13:22:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 13:22:16,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:16,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:16,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:16,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:22:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:22:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:22:16,297 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:16,455 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-28 13:22:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:22:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 13:22:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 13:22:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 13:22:16,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 13:22:16,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:16,514 INFO L225 Difference]: With dead ends: 126 [2022-04-28 13:22:16,514 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 13:22:16,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:22:16,515 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:16,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:22:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 13:22:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 13:22:16,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:16,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:16,570 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:16,570 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:16,572 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 13:22:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:22:16,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:16,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:16,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 13:22:16,572 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 13:22:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:16,574 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 13:22:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:22:16,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:16,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:16,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:16,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:22:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-28 13:22:16,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-28 13:22:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:16,576 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-28 13:22:16,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 13:22:16,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-28 13:22:16,724 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-28 13:22:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 13:22:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 13:22:16,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:16,725 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:16,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 13:22:16,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:16,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-28 13:22:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:16,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068659916] [2022-04-28 13:22:21,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:21,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-28 13:22:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:21,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923996435] [2022-04-28 13:22:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:21,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:21,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614713807] [2022-04-28 13:22:21,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:22:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:21,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:21,045 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-28 13:22:21,046 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-28 13:22:21,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:22:21,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:21,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:22:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:21,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:21,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 13:22:21,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:21,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:21,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:21,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:21,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {5645#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-28 13:22:21,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,364 INFO L272 TraceCheckUtils]: 8: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,369 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,372 INFO L272 TraceCheckUtils]: 18: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,373 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5661#(<= ~counter~0 1)} is VALID [2022-04-28 13:22:21,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,374 INFO L272 TraceCheckUtils]: 26: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,376 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,376 INFO L272 TraceCheckUtils]: 31: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,377 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,379 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-28 13:22:21,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {5716#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {5771#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,397 INFO L272 TraceCheckUtils]: 44: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,399 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,399 INFO L272 TraceCheckUtils]: 49: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,400 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {5771#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {5771#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5771#(<= ~counter~0 3)} is VALID [2022-04-28 13:22:21,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {5771#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5814#(<= |main_#t~post6| 3)} is VALID [2022-04-28 13:22:21,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {5638#false} is VALID [2022-04-28 13:22:21,402 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 13:22:21,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 13:22:21,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 13:22:21,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 13:22:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 13:22:21,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:21,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-28 13:22:21,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-28 13:22:21,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-28 13:22:21,693 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-28 13:22:21,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {5638#false} is VALID [2022-04-28 13:22:21,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {5846#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5842#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:22:21,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {5846#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {5846#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,695 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 50)} #86#return; {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,695 INFO L272 TraceCheckUtils]: 49: Hoare triple {5846#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,696 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 50)} #84#return; {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,696 INFO L272 TraceCheckUtils]: 44: Hoare triple {5846#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 50)} is VALID [2022-04-28 13:22:21,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 49)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,698 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #82#return; {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,698 INFO L272 TraceCheckUtils]: 36: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,698 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #80#return; {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L272 TraceCheckUtils]: 31: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 49)} #78#return; {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,699 INFO L272 TraceCheckUtils]: 26: Hoare triple {5889#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {5889#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5889#(< ~counter~0 49)} is VALID [2022-04-28 13:22:21,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,701 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #82#return; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,701 INFO L272 TraceCheckUtils]: 18: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #80#return; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L272 TraceCheckUtils]: 13: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 48)} #78#return; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-28 13:22:21,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-28 13:22:21,703 INFO L272 TraceCheckUtils]: 8: Hoare triple {5944#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-28 13:22:21,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {5944#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {5999#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5944#(< ~counter~0 48)} is VALID [2022-04-28 13:22:21,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {5999#(< ~counter~0 47)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5999#(< ~counter~0 47)} is VALID [2022-04-28 13:22:21,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 47)} call #t~ret7 := main(); {5999#(< ~counter~0 47)} is VALID [2022-04-28 13:22:21,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 47)} {5637#true} #92#return; {5999#(< ~counter~0 47)} is VALID [2022-04-28 13:22:21,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 47)} assume true; {5999#(< ~counter~0 47)} is VALID [2022-04-28 13:22:21,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5999#(< ~counter~0 47)} is VALID [2022-04-28 13:22:21,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-28 13:22:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:22:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:21,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923996435] [2022-04-28 13:22:21,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614713807] [2022-04-28 13:22:21,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614713807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:22:21,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:22:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:22:21,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068659916] [2022-04-28 13:22:21,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068659916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:21,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:22:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086552654] [2022-04-28 13:22:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 13:22:21,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:21,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:22:21,738 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-28 13:22:21,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:22:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:22:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:22:21,739 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:22:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:22,023 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-28 13:22:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:22:22,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 13:22:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:22:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 13:22:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:22:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 13:22:22,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 13:22:22,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:22,091 INFO L225 Difference]: With dead ends: 145 [2022-04-28 13:22:22,091 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 13:22:22,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:22:22,092 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:22,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:22:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 13:22:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 13:22:22,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:22,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:22:22,185 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:22:22,185 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:22:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:22,188 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 13:22:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 13:22:22,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:22,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:22,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 13:22:22,189 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 13:22:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:22,192 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 13:22:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 13:22:22,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:22,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:22,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:22,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 13:22:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-28 13:22:22,195 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-28 13:22:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:22,195 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-28 13:22:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:22:22,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-28 13:22:22,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-28 13:22:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 13:22:22,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:22,335 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:22,352 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-28 13:22:22,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 13:22:22,536 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:22,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-28 13:22:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412986546] [2022-04-28 13:22:26,513 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:26,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-28 13:22:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:26,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380491241] [2022-04-28 13:22:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:26,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097156390] [2022-04-28 13:22:26,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:22:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:26,529 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-28 13:22:26,554 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-28 13:22:26,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:22:26,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:26,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 13:22:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:26,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:27,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 13:22:27,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 13:22:27,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 13:22:27,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 13:22:27,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,029 INFO L272 TraceCheckUtils]: 8: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,030 INFO L272 TraceCheckUtils]: 13: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,031 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,031 INFO L272 TraceCheckUtils]: 18: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,032 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,033 INFO L272 TraceCheckUtils]: 26: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,034 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,034 INFO L272 TraceCheckUtils]: 31: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,035 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,035 INFO L272 TraceCheckUtils]: 36: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,036 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,037 INFO L272 TraceCheckUtils]: 44: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,038 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,038 INFO L272 TraceCheckUtils]: 49: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:27,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:27,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:27,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:27,039 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:22:27,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:22:27,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:22:27,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:22:27,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 13:22:27,041 INFO L272 TraceCheckUtils]: 58: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:27,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:27,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 13:22:27,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 13:22:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:22:27,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:28,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-28 13:22:28,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-28 13:22:28,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:28,078 INFO L272 TraceCheckUtils]: 58: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:28,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:22:28,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:22:28,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:22:28,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,107 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,107 INFO L272 TraceCheckUtils]: 49: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,107 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,108 INFO L272 TraceCheckUtils]: 44: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 50);havoc #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,111 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,112 INFO L272 TraceCheckUtils]: 36: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,112 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,112 INFO L272 TraceCheckUtils]: 31: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,113 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,113 INFO L272 TraceCheckUtils]: 26: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 50);havoc #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:22:28,122 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,122 INFO L272 TraceCheckUtils]: 18: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,122 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L272 TraceCheckUtils]: 13: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-28 13:22:28,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-28 13:22:28,124 INFO L272 TraceCheckUtils]: 8: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-28 13:22:28,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:22:28,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-28 13:22:28,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-28 13:22:28,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-28 13:22:28,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-28 13:22:28,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-28 13:22:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 13:22:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:22:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380491241] [2022-04-28 13:22:28,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:22:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097156390] [2022-04-28 13:22:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097156390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:22:28,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:22:28,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 13:22:28,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:22:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412986546] [2022-04-28 13:22:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412986546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:22:28,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:22:28,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:22:28,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744914610] [2022-04-28 13:22:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:22:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 13:22:28,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:22:28,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:22:28,157 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-28 13:22:28,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:22:28,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:22:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:22:28,157 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:22:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:28,878 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-28 13:22:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 13:22:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 13:22:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:22:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:22:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 13:22:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:22:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 13:22:28,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-28 13:22:28,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:28,940 INFO L225 Difference]: With dead ends: 181 [2022-04-28 13:22:28,940 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 13:22:28,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 13:22:28,943 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:22:28,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 13:22:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 13:22:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 13:22:29,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:22:29,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:22:29,029 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:22:29,029 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:22:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:29,033 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 13:22:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 13:22:29,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:29,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:29,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 13:22:29,034 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 13:22:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:22:29,036 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 13:22:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 13:22:29,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:22:29,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:22:29,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:22:29,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:22:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 13:22:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-28 13:22:29,041 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-28 13:22:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:22:29,041 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-28 13:22:29,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 13:22:29,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-28 13:22:29,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:22:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-28 13:22:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 13:22:29,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:22:29,182 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:22:29,199 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-28 13:22:29,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 13:22:29,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:22:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:22:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-28 13:22:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:22:29,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460971370] [2022-04-28 13:22:32,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:22:32,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:22:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-28 13:22:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:22:32,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288219562] [2022-04-28 13:22:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:22:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:22:32,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:22:32,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813651907] [2022-04-28 13:22:32,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:22:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:22:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:22:32,486 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-28 13:22:32,489 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-28 13:22:32,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:22:32,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:22:32,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 13:22:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:22:32,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:22:34,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {8115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {8115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8115#true} is VALID [2022-04-28 13:22:34,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 50);havoc #t~post5; {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L272 TraceCheckUtils]: 13: Hoare triple {8115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:34,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,441 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8115#true} #80#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:22:34,441 INFO L272 TraceCheckUtils]: 18: Hoare triple {8173#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,442 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8115#true} {8173#(= main_~A~0 main_~r~0)} #82#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 13:22:34,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {8173#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:22:34,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:22:34,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 13:22:34,444 INFO L272 TraceCheckUtils]: 26: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:34,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,445 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #78#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,445 INFO L272 TraceCheckUtils]: 31: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,446 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,446 INFO L272 TraceCheckUtils]: 36: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,447 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,448 INFO L272 TraceCheckUtils]: 44: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,449 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,449 INFO L272 TraceCheckUtils]: 49: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-28 13:22:34,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-28 13:22:34,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-28 13:22:34,450 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} is VALID [2022-04-28 13:22:34,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:22:34,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:22:34,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 13:22:34,452 INFO L272 TraceCheckUtils]: 58: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-28 13:22:34,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:34,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:22:34,455 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} is VALID [2022-04-28 13:22:34,456 INFO L272 TraceCheckUtils]: 63: Hoare triple {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:22:34,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:22:34,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-28 13:22:34,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-28 13:22:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-28 13:22:34,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:22:53,103 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 13:23:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:23:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288219562] [2022-04-28 13:23:10,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:23:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813651907] [2022-04-28 13:23:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813651907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 13:23:10,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 13:23:10,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 13:23:10,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:23:10,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460971370] [2022-04-28 13:23:10,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460971370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:23:10,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:23:10,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:23:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75256740] [2022-04-28 13:23:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:23:10,600 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 13:23:10,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:23:10,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:23:10,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:10,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:23:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:23:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:23:10,638 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:23:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:11,657 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-28 13:23:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:23:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-28 13:23:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:23:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:23:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 13:23:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:23:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-28 13:23:11,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-28 13:23:11,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:11,761 INFO L225 Difference]: With dead ends: 188 [2022-04-28 13:23:11,761 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 13:23:11,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:23:11,762 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:23:11,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-04-28 13:23:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 13:23:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 13:23:11,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:23:11,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:11,891 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:11,891 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:11,894 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 13:23:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 13:23:11,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:11,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:11,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 13:23:11,895 INFO L87 Difference]: Start difference. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-28 13:23:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:11,898 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-28 13:23:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-28 13:23:11,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:11,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:11,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:23:11,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:23:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-28 13:23:11,902 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-28 13:23:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:23:11,902 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-28 13:23:11,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-28 13:23:11,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-28 13:23:12,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-28 13:23:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 13:23:12,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:23:12,084 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:23:12,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 13:23:12,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 13:23:12,285 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:23:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:23:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-28 13:23:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:12,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820904636] [2022-04-28 13:23:14,679 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:23:14,679 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:23:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-28 13:23:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:23:14,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158914927] [2022-04-28 13:23:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:23:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:23:14,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:23:14,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869517005] [2022-04-28 13:23:14,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:23:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:23:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:23:14,688 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-28 13:23:14,689 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-28 13:23:14,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:23:14,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:23:14,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 13:23:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:23:14,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:23:15,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 13:23:15,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 13:23:15,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 13:23:15,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 13:23:15,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,207 INFO L272 TraceCheckUtils]: 8: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,208 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,208 INFO L272 TraceCheckUtils]: 13: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:15,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,209 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,209 INFO L272 TraceCheckUtils]: 18: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,211 INFO L272 TraceCheckUtils]: 26: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,211 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,211 INFO L272 TraceCheckUtils]: 31: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,212 INFO L272 TraceCheckUtils]: 36: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,213 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,214 INFO L272 TraceCheckUtils]: 44: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,215 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,215 INFO L272 TraceCheckUtils]: 49: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:15,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:15,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:15,215 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:15,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,217 INFO L272 TraceCheckUtils]: 58: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:15,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,218 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,218 INFO L272 TraceCheckUtils]: 63: Hoare triple {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:15,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:15,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,219 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:15,219 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-28 13:23:15,220 INFO L290 TraceCheckUtils]: 68: Hoare triple {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-28 13:23:15,220 INFO L272 TraceCheckUtils]: 69: Hoare triple {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:23:15,221 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:15,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 13:23:15,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 13:23:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-28 13:23:15,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:23:26,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-28 13:23:26,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-28 13:23:26,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:26,384 INFO L272 TraceCheckUtils]: 69: Hoare triple {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:23:26,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:23:26,385 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #86#return; {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:23:26,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:26,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:26,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:23:26,386 INFO L272 TraceCheckUtils]: 63: Hoare triple {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,388 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9367#true} #84#return; {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:23:26,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:23:26,389 INFO L272 TraceCheckUtils]: 58: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 50);havoc #t~post6; {9367#true} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {9367#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9367#true} is VALID [2022-04-28 13:23:26,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {9367#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L272 TraceCheckUtils]: 49: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L272 TraceCheckUtils]: 44: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 50);havoc #t~post6; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-28 13:23:26,390 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L272 TraceCheckUtils]: 36: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L272 TraceCheckUtils]: 31: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L272 TraceCheckUtils]: 26: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 50);havoc #t~post5; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {9367#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L272 TraceCheckUtils]: 18: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-28 13:23:26,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L272 TraceCheckUtils]: 8: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 50);havoc #t~post5; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-28 13:23:26,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-28 13:23:26,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-28 13:23:26,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-28 13:23:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-28 13:23:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:23:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158914927] [2022-04-28 13:23:26,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:23:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869517005] [2022-04-28 13:23:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869517005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:23:26,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:23:26,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-28 13:23:26,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:23:26,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820904636] [2022-04-28 13:23:26,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820904636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:23:26,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:23:26,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:23:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657052061] [2022-04-28 13:23:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:23:26,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:23:26,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:23:26,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:26,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:26,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:23:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:23:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:23:26,436 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:27,377 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-28 13:23:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:23:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:23:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:23:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:23:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:23:27,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 13:23:27,486 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-28 13:23:27,488 INFO L225 Difference]: With dead ends: 186 [2022-04-28 13:23:27,488 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 13:23:27,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:23:27,489 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:23:27,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:23:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 13:23:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-28 13:23:27,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:23:27,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:27,591 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:27,591 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:27,594 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 13:23:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:23:27,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:27,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:27,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 13:23:27,594 INFO L87 Difference]: Start difference. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-28 13:23:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:27,596 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-28 13:23:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:23:27,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:27,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:27,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:23:27,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:23:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-28 13:23:27,599 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-28 13:23:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:23:27,599 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-28 13:23:27,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:27,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-28 13:23:27,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-28 13:23:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 13:23:27,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:23:27,754 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:23:27,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 13:23:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 13:23:27,954 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:23:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:23:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-28 13:23:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:27,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107663891] [2022-04-28 13:23:31,694 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:23:31,694 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:23:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-28 13:23:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:23:31,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473483865] [2022-04-28 13:23:31,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:23:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:23:31,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:23:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567675048] [2022-04-28 13:23:31,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:23:31,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:23:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:23:31,714 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:23:31,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 13:23:31,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 13:23:31,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:23:31,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:23:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:23:31,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:23:32,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 13:23:32,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:32,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:32,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:32,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:32,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {10720#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:32,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {10720#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,050 INFO L272 TraceCheckUtils]: 13: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,051 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,053 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {10736#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10736#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:32,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {10736#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {10791#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,055 INFO L272 TraceCheckUtils]: 26: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,058 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,058 INFO L272 TraceCheckUtils]: 31: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,059 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,059 INFO L272 TraceCheckUtils]: 36: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,060 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {10791#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10791#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:32,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {10791#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {10846#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,062 INFO L272 TraceCheckUtils]: 44: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,062 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,063 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,063 INFO L272 TraceCheckUtils]: 49: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,064 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,064 INFO L272 TraceCheckUtils]: 54: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,065 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,065 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {10846#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10846#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:32,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {10846#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10901#(<= |main_#t~post5| 3)} is VALID [2022-04-28 13:23:32,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 50);havoc #t~post5; {10713#false} is VALID [2022-04-28 13:23:32,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 50);havoc #t~post6; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 13:23:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-28 13:23:32,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:23:32,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,320 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 50);havoc #t~post6; {10713#false} is VALID [2022-04-28 13:23:32,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-28 13:23:32,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {10713#false} is VALID [2022-04-28 13:23:32,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {10975#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10971#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:23:32,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {10975#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,323 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #82#return; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,323 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,323 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,323 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,323 INFO L272 TraceCheckUtils]: 54: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,323 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #80#return; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L272 TraceCheckUtils]: 49: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 50)} #78#return; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,324 INFO L272 TraceCheckUtils]: 44: Hoare triple {10975#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {11030#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(< ~counter~0 50)} is VALID [2022-04-28 13:23:32,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,326 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #82#return; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,326 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #80#return; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L272 TraceCheckUtils]: 31: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 49)} #78#return; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,328 INFO L272 TraceCheckUtils]: 26: Hoare triple {11030#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {11030#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {11085#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(< ~counter~0 49)} is VALID [2022-04-28 13:23:32,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {11085#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #82#return; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,329 INFO L272 TraceCheckUtils]: 18: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #80#return; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 48)} #78#return; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-28 13:23:32,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-28 13:23:32,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-28 13:23:32,331 INFO L272 TraceCheckUtils]: 8: Hoare triple {11085#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-28 13:23:32,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(< ~counter~0 48)} is VALID [2022-04-28 13:23:32,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(< ~counter~0 47)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {11140#(< ~counter~0 47)} is VALID [2022-04-28 13:23:32,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 47)} call #t~ret7 := main(); {11140#(< ~counter~0 47)} is VALID [2022-04-28 13:23:32,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 47)} {10712#true} #92#return; {11140#(< ~counter~0 47)} is VALID [2022-04-28 13:23:32,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 47)} assume true; {11140#(< ~counter~0 47)} is VALID [2022-04-28 13:23:32,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11140#(< ~counter~0 47)} is VALID [2022-04-28 13:23:32,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-28 13:23:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 13:23:32,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:23:32,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473483865] [2022-04-28 13:23:32,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:23:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567675048] [2022-04-28 13:23:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567675048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:23:32,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:23:32,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:23:32,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:23:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107663891] [2022-04-28 13:23:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107663891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:23:32,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:23:32,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:23:32,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450123529] [2022-04-28 13:23:32,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:23:32,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:23:32,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:23:32,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:32,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:32,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:23:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:32,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:23:32,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:23:32,368 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:32,566 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-28 13:23:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:23:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-28 13:23:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:23:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 13:23:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-28 13:23:32,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-28 13:23:32,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:32,636 INFO L225 Difference]: With dead ends: 170 [2022-04-28 13:23:32,636 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 13:23:32,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:23:32,637 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:23:32,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:23:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 13:23:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 13:23:32,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:23:32,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:32,785 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:32,785 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:32,787 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 13:23:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:23:32,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:32,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:32,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 13:23:32,788 INFO L87 Difference]: Start difference. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-28 13:23:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:32,789 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-28 13:23:32,789 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:23:32,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:32,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:32,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:23:32,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:23:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 13:23:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-28 13:23:32,792 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-28 13:23:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:23:32,792 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-28 13:23:32,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 13:23:32,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-28 13:23:32,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-28 13:23:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 13:23:32,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:23:32,947 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:23:32,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 13:23:33,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 13:23:33,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:23:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:23:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-28 13:23:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768728781] [2022-04-28 13:23:37,238 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:23:37,239 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:23:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-28 13:23:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:23:37,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450862838] [2022-04-28 13:23:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:23:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:23:37,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:23:37,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636310888] [2022-04-28 13:23:37,247 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:23:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:23:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:23:37,248 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:23:37,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 13:23:37,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:23:37,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:23:37,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:23:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:23:37,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:23:37,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 13:23:37,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:37,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:37,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:37,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:37,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {12039#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-28 13:23:37,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {12039#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {12055#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,618 INFO L272 TraceCheckUtils]: 8: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,619 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,620 INFO L272 TraceCheckUtils]: 13: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,621 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,622 INFO L272 TraceCheckUtils]: 18: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12055#(<= ~counter~0 1)} is VALID [2022-04-28 13:23:37,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,624 INFO L272 TraceCheckUtils]: 26: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,625 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,626 INFO L272 TraceCheckUtils]: 31: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,627 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,627 INFO L272 TraceCheckUtils]: 36: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,629 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {12110#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12110#(<= ~counter~0 2)} is VALID [2022-04-28 13:23:37,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {12110#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {12165#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,630 INFO L272 TraceCheckUtils]: 44: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,631 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,632 INFO L272 TraceCheckUtils]: 49: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,633 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,633 INFO L272 TraceCheckUtils]: 54: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,635 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-28 13:23:37,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {12220#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,636 INFO L272 TraceCheckUtils]: 62: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,637 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,637 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,637 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,638 INFO L272 TraceCheckUtils]: 67: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,638 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,639 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,639 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {12220#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,640 INFO L290 TraceCheckUtils]: 73: Hoare triple {12220#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12220#(<= ~counter~0 4)} is VALID [2022-04-28 13:23:37,640 INFO L290 TraceCheckUtils]: 74: Hoare triple {12220#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12263#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:23:37,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {12032#false} is VALID [2022-04-28 13:23:37,640 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 13:23:37,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 13:23:37,640 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 13:23:37,641 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 13:23:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 13:23:37,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:23:37,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-28 13:23:37,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-28 13:23:37,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-28 13:23:37,944 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-28 13:23:37,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {12032#false} is VALID [2022-04-28 13:23:37,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {12295#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12291#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:23:37,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {12295#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {12295#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,945 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 50)} #86#return; {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,945 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L272 TraceCheckUtils]: 67: Hoare triple {12295#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 50)} #84#return; {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,946 INFO L272 TraceCheckUtils]: 62: Hoare triple {12295#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {12295#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,947 INFO L290 TraceCheckUtils]: 60: Hoare triple {12338#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12295#(< ~counter~0 50)} is VALID [2022-04-28 13:23:37,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 49)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,948 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #82#return; {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,948 INFO L272 TraceCheckUtils]: 54: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,949 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #80#return; {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,949 INFO L272 TraceCheckUtils]: 49: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,949 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 49)} #78#return; {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,950 INFO L272 TraceCheckUtils]: 44: Hoare triple {12338#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {12338#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12338#(< ~counter~0 49)} is VALID [2022-04-28 13:23:37,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,951 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #82#return; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,951 INFO L272 TraceCheckUtils]: 36: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,952 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #80#return; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,952 INFO L272 TraceCheckUtils]: 31: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,953 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 48)} #78#return; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,953 INFO L272 TraceCheckUtils]: 26: Hoare triple {12393#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {12448#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12393#(< ~counter~0 48)} is VALID [2022-04-28 13:23:37,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {12448#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,954 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #82#return; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L272 TraceCheckUtils]: 18: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #80#return; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,955 INFO L272 TraceCheckUtils]: 13: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,956 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 47)} #78#return; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-28 13:23:37,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-28 13:23:37,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-28 13:23:37,956 INFO L272 TraceCheckUtils]: 8: Hoare triple {12448#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-28 13:23:37,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {12448#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {12503#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12448#(< ~counter~0 47)} is VALID [2022-04-28 13:23:37,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {12503#(< ~counter~0 46)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12503#(< ~counter~0 46)} is VALID [2022-04-28 13:23:37,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 46)} call #t~ret7 := main(); {12503#(< ~counter~0 46)} is VALID [2022-04-28 13:23:37,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 46)} {12031#true} #92#return; {12503#(< ~counter~0 46)} is VALID [2022-04-28 13:23:37,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 46)} assume true; {12503#(< ~counter~0 46)} is VALID [2022-04-28 13:23:37,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12503#(< ~counter~0 46)} is VALID [2022-04-28 13:23:37,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-28 13:23:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 13:23:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:23:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450862838] [2022-04-28 13:23:37,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:23:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636310888] [2022-04-28 13:23:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636310888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:23:37,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:23:37,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:23:37,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:23:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768728781] [2022-04-28 13:23:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768728781] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:23:37,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:23:37,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:23:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578461768] [2022-04-28 13:23:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:23:37,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 13:23:37,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:23:37,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:23:38,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:23:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:23:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:23:38,000 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:23:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:38,390 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-28 13:23:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:23:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-28 13:23:38,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:23:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:23:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 13:23:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:23:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-28 13:23:38,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-28 13:23:38,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:38,466 INFO L225 Difference]: With dead ends: 181 [2022-04-28 13:23:38,466 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 13:23:38,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:23:38,467 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:23:38,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:23:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 13:23:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-28 13:23:38,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:23:38,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:38,602 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:38,603 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:38,605 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 13:23:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 13:23:38,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:38,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:38,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 13:23:38,606 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-28 13:23:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:23:38,608 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-28 13:23:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-28 13:23:38,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:23:38,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:23:38,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:23:38,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:23:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 13:23:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-28 13:23:38,611 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-28 13:23:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:23:38,612 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-28 13:23:38,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 13:23:38,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-28 13:23:38,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:23:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-28 13:23:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 13:23:38,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:23:38,796 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:23:38,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 13:23:38,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 13:23:38,997 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:23:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:23:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-28 13:23:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:23:38,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039905145] [2022-04-28 13:23:41,545 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:23:41,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:23:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-28 13:23:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:23:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359882472] [2022-04-28 13:23:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:23:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:23:41,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:23:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562743363] [2022-04-28 13:23:41,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:23:41,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:23:41,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:23:41,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:23:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 13:23:41,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:23:41,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:23:41,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 13:23:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:23:41,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:23:42,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 13:23:42,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 13:23:42,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 13:23:42,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 13:23:42,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,345 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,345 INFO L272 TraceCheckUtils]: 13: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,346 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,346 INFO L272 TraceCheckUtils]: 18: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,347 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,348 INFO L272 TraceCheckUtils]: 26: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,348 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,348 INFO L272 TraceCheckUtils]: 31: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,349 INFO L272 TraceCheckUtils]: 36: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,350 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,351 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,352 INFO L272 TraceCheckUtils]: 44: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,352 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #78#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,352 INFO L272 TraceCheckUtils]: 49: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,353 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #80#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,353 INFO L272 TraceCheckUtils]: 54: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:42,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:42,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:23:42,355 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #82#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,356 INFO L272 TraceCheckUtils]: 62: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,356 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,357 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #84#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,357 INFO L272 TraceCheckUtils]: 67: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:23:42,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:23:42,357 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:23:42,357 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:23:42,358 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #86#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:23:42,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:23:42,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:23:42,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:23:42,360 INFO L290 TraceCheckUtils]: 75: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-28 13:23:42,361 INFO L272 TraceCheckUtils]: 76: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:23:42,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:23:42,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 13:23:42,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 13:23:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:23:42,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:24:13,270 WARN L232 SmtUtils]: Spent 14.17s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 13:25:28,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-28 13:25:28,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-28 13:25:28,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:25:28,903 INFO L272 TraceCheckUtils]: 76: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:25:28,903 INFO L290 TraceCheckUtils]: 75: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,904 INFO L290 TraceCheckUtils]: 74: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,963 INFO L290 TraceCheckUtils]: 72: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:25:28,964 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,964 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,964 INFO L272 TraceCheckUtils]: 67: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,964 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,965 INFO L272 TraceCheckUtils]: 62: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 50);havoc #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,968 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #82#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:25:28,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:25:28,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:25:28,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:25:28,969 INFO L272 TraceCheckUtils]: 54: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,969 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #80#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L272 TraceCheckUtils]: 49: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #78#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,971 INFO L272 TraceCheckUtils]: 44: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:25:28,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:25:28,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:25:28,988 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,988 INFO L272 TraceCheckUtils]: 36: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,988 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,998 INFO L272 TraceCheckUtils]: 31: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,998 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:28,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:28,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:28,999 INFO L272 TraceCheckUtils]: 26: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:28,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 50);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:28,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,000 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:29,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L272 TraceCheckUtils]: 18: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:29,001 INFO L272 TraceCheckUtils]: 13: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:29,002 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:29,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-28 13:25:29,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-28 13:25:29,002 INFO L272 TraceCheckUtils]: 8: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-28 13:25:29,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 50);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:25:29,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-28 13:25:29,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-28 13:25:29,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-28 13:25:29,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-28 13:25:29,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-28 13:25:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 22 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 13:25:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:25:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359882472] [2022-04-28 13:25:29,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:25:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562743363] [2022-04-28 13:25:29,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562743363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:25:29,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:25:29,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-28 13:25:29,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:25:29,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039905145] [2022-04-28 13:25:29,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039905145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:25:29,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:25:29,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:25:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930256018] [2022-04-28 13:25:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:25:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 13:25:29,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:25:29,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:25:29,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:29,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:25:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:25:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 13:25:29,049 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:25:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:31,742 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-28 13:25:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 13:25:31,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-28 13:25:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:25:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:25:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:25:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:25:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-28 13:25:31,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-28 13:25:31,833 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-28 13:25:31,836 INFO L225 Difference]: With dead ends: 193 [2022-04-28 13:25:31,836 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 13:25:31,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=70, Invalid=234, Unknown=2, NotChecked=0, Total=306 [2022-04-28 13:25:31,836 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:25:31,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:25:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 13:25:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-28 13:25:31,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:25:31,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:25:31,981 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:25:31,982 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:25:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:31,984 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 13:25:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 13:25:31,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:31,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:31,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 13:25:31,985 INFO L87 Difference]: Start difference. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-28 13:25:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:31,988 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-28 13:25:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-28 13:25:31,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:31,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:31,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:25:31,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:25:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-28 13:25:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-28 13:25:31,991 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-28 13:25:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:25:31,991 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-28 13:25:31,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 13:25:31,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-28 13:25:32,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-28 13:25:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 13:25:32,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:25:32,210 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:25:32,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 13:25:32,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:32,411 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:25:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:25:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-28 13:25:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:32,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859419835] [2022-04-28 13:25:34,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:25:34,842 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:25:34,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-28 13:25:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:25:34,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403277220] [2022-04-28 13:25:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:25:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:25:34,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:25:34,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135526560] [2022-04-28 13:25:34,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:25:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:25:34,852 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:25:34,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 13:25:34,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:25:34,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:25:34,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 13:25:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:25:34,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:25:36,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 50);havoc #t~post5; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,557 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 13:25:36,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post5 < 50);havoc #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,559 INFO L272 TraceCheckUtils]: 26: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #78#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,559 INFO L272 TraceCheckUtils]: 31: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,560 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #80#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,560 INFO L272 TraceCheckUtils]: 36: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,561 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #82#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,563 INFO L272 TraceCheckUtils]: 44: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,563 INFO L272 TraceCheckUtils]: 49: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,564 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,564 INFO L272 TraceCheckUtils]: 54: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,565 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,566 INFO L272 TraceCheckUtils]: 62: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,566 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,567 INFO L272 TraceCheckUtils]: 67: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,567 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #86#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:25:36,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post6 < 50);havoc #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,569 INFO L272 TraceCheckUtils]: 76: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,570 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #84#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,570 INFO L272 TraceCheckUtils]: 81: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,571 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #86#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 13:25:36,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 13:25:36,571 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 13:25:36,571 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 13:25:36,571 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 13:25:36,571 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 13:25:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:25:36,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:25:36,801 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-28 13:25:36,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-28 13:25:36,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-28 13:25:36,801 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-28 13:25:36,801 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-28 13:25:36,802 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #86#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,802 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,802 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,802 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,802 INFO L272 TraceCheckUtils]: 81: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,803 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #84#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,803 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,803 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,803 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,803 INFO L272 TraceCheckUtils]: 76: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,803 INFO L290 TraceCheckUtils]: 75: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,803 INFO L290 TraceCheckUtils]: 74: Hoare triple {15404#(not (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,804 INFO L290 TraceCheckUtils]: 73: Hoare triple {15404#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,804 INFO L290 TraceCheckUtils]: 72: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,805 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #86#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,805 INFO L272 TraceCheckUtils]: 67: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,806 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #84#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,806 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,806 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,806 INFO L272 TraceCheckUtils]: 62: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,807 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #82#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L272 TraceCheckUtils]: 54: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #80#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,808 INFO L272 TraceCheckUtils]: 49: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,809 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #78#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,809 INFO L272 TraceCheckUtils]: 44: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,809 INFO L290 TraceCheckUtils]: 43: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 13:25:36,811 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #82#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,811 INFO L272 TraceCheckUtils]: 36: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,811 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #80#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L272 TraceCheckUtils]: 31: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #78#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,812 INFO L272 TraceCheckUtils]: 26: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {15404#(not (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-28 13:25:36,813 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 50);havoc #t~post5; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-28 13:25:36,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-28 13:25:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:25:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:25:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403277220] [2022-04-28 13:25:36,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:25:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135526560] [2022-04-28 13:25:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135526560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:25:36,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:25:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 13:25:36,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:25:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859419835] [2022-04-28 13:25:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859419835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:25:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:25:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:25:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416821751] [2022-04-28 13:25:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:25:36,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 13:25:36,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:25:36,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:25:36,860 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-28 13:25:36,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:25:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:25:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:25:36,860 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:25:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:37,112 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-28 13:25:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:25:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-28 13:25:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:25:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:25:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 13:25:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:25:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-28 13:25:37,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-28 13:25:37,181 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-28 13:25:37,183 INFO L225 Difference]: With dead ends: 197 [2022-04-28 13:25:37,183 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 13:25:37,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:25:37,184 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:25:37,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:25:37,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 13:25:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-28 13:25:37,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:25:37,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:37,330 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:37,331 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:37,335 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 13:25:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 13:25:37,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:37,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:37,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 13:25:37,336 INFO L87 Difference]: Start difference. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-28 13:25:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:37,338 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-28 13:25:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-28 13:25:37,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:37,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:37,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:25:37,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:25:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-28 13:25:37,342 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-28 13:25:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:25:37,342 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-28 13:25:37,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 13:25:37,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-28 13:25:37,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-28 13:25:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 13:25:37,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:25:37,582 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:25:37,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 13:25:37,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:37,783 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:25:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:25:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-28 13:25:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:37,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418818731] [2022-04-28 13:25:41,306 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:25:41,306 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:25:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-28 13:25:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:25:41,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181318969] [2022-04-28 13:25:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:25:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:25:41,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:25:41,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593075572] [2022-04-28 13:25:41,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:25:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:25:41,316 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:25:41,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 13:25:41,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:25:41,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:25:41,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:25:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:25:41,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:25:41,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 13:25:41,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:41,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:41,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:41,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:41,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {16796#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:41,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {16796#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {16812#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,758 INFO L272 TraceCheckUtils]: 8: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,759 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,759 INFO L272 TraceCheckUtils]: 13: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,761 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,762 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {16812#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16812#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:41,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {16812#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {16867#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,764 INFO L272 TraceCheckUtils]: 26: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,765 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,765 INFO L272 TraceCheckUtils]: 31: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,767 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,767 INFO L272 TraceCheckUtils]: 36: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,768 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {16867#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16867#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:41,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {16867#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {16922#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,770 INFO L272 TraceCheckUtils]: 44: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,771 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,772 INFO L272 TraceCheckUtils]: 49: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,773 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,773 INFO L272 TraceCheckUtils]: 54: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,773 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,774 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {16922#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16922#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:41,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {16922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {16977#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,776 INFO L272 TraceCheckUtils]: 62: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,776 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,777 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,778 INFO L272 TraceCheckUtils]: 67: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,779 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,779 INFO L272 TraceCheckUtils]: 72: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,781 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {16977#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16977#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:41,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {16977#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17032#(<= |main_#t~post5| 4)} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 50);havoc #t~post6; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 13:25:41,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 13:25:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-28 13:25:41,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:25:42,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,156 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 50);havoc #t~post6; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-28 13:25:42,156 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {16789#false} is VALID [2022-04-28 13:25:42,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {17106#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17102#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:25:42,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {17106#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,157 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #82#return; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,157 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,157 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L272 TraceCheckUtils]: 72: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #80#return; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,158 INFO L272 TraceCheckUtils]: 67: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,161 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 50)} #78#return; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,161 INFO L272 TraceCheckUtils]: 62: Hoare triple {17106#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {17106#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {17161#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17106#(< ~counter~0 50)} is VALID [2022-04-28 13:25:42,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {17161#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,163 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #82#return; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,163 INFO L272 TraceCheckUtils]: 54: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,171 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #80#return; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,171 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,171 INFO L272 TraceCheckUtils]: 49: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,171 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 49)} #78#return; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,172 INFO L272 TraceCheckUtils]: 44: Hoare triple {17161#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {17161#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,173 INFO L290 TraceCheckUtils]: 42: Hoare triple {17216#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17161#(< ~counter~0 49)} is VALID [2022-04-28 13:25:42,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {17216#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,173 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #82#return; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,173 INFO L272 TraceCheckUtils]: 36: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #80#return; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L272 TraceCheckUtils]: 31: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 48)} #78#return; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,175 INFO L272 TraceCheckUtils]: 26: Hoare triple {17216#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {17216#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {17271#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17216#(< ~counter~0 48)} is VALID [2022-04-28 13:25:42,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {17271#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,176 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #82#return; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,176 INFO L272 TraceCheckUtils]: 18: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,176 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #80#return; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L272 TraceCheckUtils]: 13: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 47)} #78#return; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-28 13:25:42,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {17271#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-28 13:25:42,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {17271#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {17326#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17271#(< ~counter~0 47)} is VALID [2022-04-28 13:25:42,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {17326#(< ~counter~0 46)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {17326#(< ~counter~0 46)} is VALID [2022-04-28 13:25:42,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 46)} call #t~ret7 := main(); {17326#(< ~counter~0 46)} is VALID [2022-04-28 13:25:42,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 46)} {16788#true} #92#return; {17326#(< ~counter~0 46)} is VALID [2022-04-28 13:25:42,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 46)} assume true; {17326#(< ~counter~0 46)} is VALID [2022-04-28 13:25:42,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17326#(< ~counter~0 46)} is VALID [2022-04-28 13:25:42,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-28 13:25:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:25:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:25:42,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181318969] [2022-04-28 13:25:42,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:25:42,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593075572] [2022-04-28 13:25:42,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593075572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:25:42,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:25:42,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:25:42,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:25:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418818731] [2022-04-28 13:25:42,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418818731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:25:42,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:25:42,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:25:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294702173] [2022-04-28 13:25:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:25:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 13:25:42,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:25:42,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:42,228 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-28 13:25:42,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:25:42,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:25:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:25:42,229 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:42,591 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-28 13:25:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:25:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-28 13:25:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:25:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 13:25:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-28 13:25:42,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-28 13:25:42,671 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-28 13:25:42,674 INFO L225 Difference]: With dead ends: 242 [2022-04-28 13:25:42,674 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 13:25:42,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:25:42,675 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:25:42,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:25:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 13:25:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 13:25:42,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:25:42,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:42,820 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:42,820 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:42,823 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 13:25:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:25:42,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:42,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:42,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 13:25:42,824 INFO L87 Difference]: Start difference. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-28 13:25:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:42,826 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-28 13:25:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:25:42,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:42,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:42,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:25:42,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:25:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 13:25:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-28 13:25:42,830 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-28 13:25:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:25:42,830 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-28 13:25:42,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:42,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-28 13:25:43,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-28 13:25:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 13:25:43,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:25:43,060 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:25:43,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 13:25:43,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:43,261 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:25:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:25:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-28 13:25:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:43,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1944032939] [2022-04-28 13:25:45,578 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:25:45,578 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:25:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-28 13:25:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:25:45,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470518961] [2022-04-28 13:25:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:25:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:25:45,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:25:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198228218] [2022-04-28 13:25:45,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:25:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:25:45,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:25:45,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 13:25:45,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:25:45,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:25:45,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:25:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:25:45,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:25:46,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 13:25:46,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:46,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:46,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:46,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:46,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {18575#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-28 13:25:46,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {18575#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {18591#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,052 INFO L272 TraceCheckUtils]: 8: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,053 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,054 INFO L272 TraceCheckUtils]: 13: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,055 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,057 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {18591#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18591#(<= ~counter~0 1)} is VALID [2022-04-28 13:25:46,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {18591#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {18646#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,058 INFO L272 TraceCheckUtils]: 26: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,060 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,060 INFO L272 TraceCheckUtils]: 31: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,062 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,062 INFO L272 TraceCheckUtils]: 36: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,063 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {18646#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18646#(<= ~counter~0 2)} is VALID [2022-04-28 13:25:46,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {18646#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {18701#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,065 INFO L272 TraceCheckUtils]: 44: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,066 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,066 INFO L272 TraceCheckUtils]: 49: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,067 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,068 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,068 INFO L272 TraceCheckUtils]: 54: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,069 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-28 13:25:46,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {18701#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {18756#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,071 INFO L272 TraceCheckUtils]: 62: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,072 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,074 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {18756#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {18756#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18756#(<= ~counter~0 4)} is VALID [2022-04-28 13:25:46,075 INFO L290 TraceCheckUtils]: 74: Hoare triple {18756#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,076 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,077 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,078 INFO L272 TraceCheckUtils]: 81: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,079 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,079 INFO L290 TraceCheckUtils]: 86: Hoare triple {18799#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {18799#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18799#(<= ~counter~0 5)} is VALID [2022-04-28 13:25:46,080 INFO L290 TraceCheckUtils]: 88: Hoare triple {18799#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18842#(<= |main_#t~post6| 5)} is VALID [2022-04-28 13:25:46,080 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {18568#false} is VALID [2022-04-28 13:25:46,080 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 13:25:46,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 13:25:46,080 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 13:25:46,081 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 13:25:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 296 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 13:25:46,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:25:46,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-28 13:25:46,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-28 13:25:46,455 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-28 13:25:46,455 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-28 13:25:46,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {18568#false} is VALID [2022-04-28 13:25:46,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {18874#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18870#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:25:46,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {18874#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {18874#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,457 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 50)} #86#return; {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,457 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,457 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,457 INFO L272 TraceCheckUtils]: 81: Hoare triple {18874#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,457 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 50)} #84#return; {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,458 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,458 INFO L272 TraceCheckUtils]: 76: Hoare triple {18874#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,458 INFO L290 TraceCheckUtils]: 75: Hoare triple {18874#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {18917#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18874#(< ~counter~0 50)} is VALID [2022-04-28 13:25:46,459 INFO L290 TraceCheckUtils]: 73: Hoare triple {18917#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {18917#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 49)} #86#return; {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,460 INFO L272 TraceCheckUtils]: 67: Hoare triple {18917#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,461 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 49)} #84#return; {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,461 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,461 INFO L272 TraceCheckUtils]: 62: Hoare triple {18917#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {18917#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {18960#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18917#(< ~counter~0 49)} is VALID [2022-04-28 13:25:46,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 48)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,463 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #82#return; {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,463 INFO L272 TraceCheckUtils]: 54: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #80#return; {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L272 TraceCheckUtils]: 49: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 48)} #78#return; {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,465 INFO L272 TraceCheckUtils]: 44: Hoare triple {18960#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {18960#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {19015#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18960#(< ~counter~0 48)} is VALID [2022-04-28 13:25:46,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {19015#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,467 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #82#return; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,467 INFO L272 TraceCheckUtils]: 36: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,467 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #80#return; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,468 INFO L272 TraceCheckUtils]: 31: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,468 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 47)} #78#return; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,469 INFO L272 TraceCheckUtils]: 26: Hoare triple {19015#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {19015#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {19070#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19015#(< ~counter~0 47)} is VALID [2022-04-28 13:25:46,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {19070#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,470 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #82#return; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,470 INFO L272 TraceCheckUtils]: 18: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,471 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #80#return; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,471 INFO L272 TraceCheckUtils]: 13: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,472 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 46)} #78#return; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-28 13:25:46,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-28 13:25:46,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-28 13:25:46,472 INFO L272 TraceCheckUtils]: 8: Hoare triple {19070#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-28 13:25:46,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {19070#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {19125#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19070#(< ~counter~0 46)} is VALID [2022-04-28 13:25:46,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {19125#(< ~counter~0 45)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {19125#(< ~counter~0 45)} is VALID [2022-04-28 13:25:46,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 45)} call #t~ret7 := main(); {19125#(< ~counter~0 45)} is VALID [2022-04-28 13:25:46,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 45)} {18567#true} #92#return; {19125#(< ~counter~0 45)} is VALID [2022-04-28 13:25:46,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 45)} assume true; {19125#(< ~counter~0 45)} is VALID [2022-04-28 13:25:46,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19125#(< ~counter~0 45)} is VALID [2022-04-28 13:25:46,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-28 13:25:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:25:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:25:46,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470518961] [2022-04-28 13:25:46,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:25:46,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198228218] [2022-04-28 13:25:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198228218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:25:46,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:25:46,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 13:25:46,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:25:46,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1944032939] [2022-04-28 13:25:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1944032939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:25:46,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:25:46,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:25:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175014119] [2022-04-28 13:25:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:25:46,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 13:25:46,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:25:46,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:46,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:46,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:25:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:25:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:25:46,528 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:46,984 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-28 13:25:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 13:25:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-28 13:25:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:25:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 13:25:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-28 13:25:46,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-28 13:25:47,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:47,076 INFO L225 Difference]: With dead ends: 240 [2022-04-28 13:25:47,076 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 13:25:47,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:25:47,076 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:25:47,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:25:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 13:25:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-28 13:25:47,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:25:47,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:25:47,287 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:25:47,287 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:25:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:47,290 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 13:25:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 13:25:47,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:47,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:47,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 13:25:47,291 INFO L87 Difference]: Start difference. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-28 13:25:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:25:47,294 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 13:25:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 13:25:47,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:25:47,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:25:47,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:25:47,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:25:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 13:25:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-28 13:25:47,299 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-28 13:25:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:25:47,299 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-28 13:25:47,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 13:25:47,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-28 13:25:47,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:25:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-28 13:25:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 13:25:47,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:25:47,597 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:25:47,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 13:25:47,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:47,798 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:25:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:25:47,798 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-28 13:25:47,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:25:47,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469007579] [2022-04-28 13:25:50,687 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:25:50,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:25:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-28 13:25:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:25:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729837947] [2022-04-28 13:25:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:25:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:25:50,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:25:50,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746995746] [2022-04-28 13:25:50,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:25:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:25:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:25:50,701 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:25:50,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 13:25:50,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:25:50,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:25:50,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 13:25:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:25:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:25:51,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 13:25:51,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 13:25:51,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 13:25:51,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 13:25:51,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,450 INFO L272 TraceCheckUtils]: 8: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,451 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,451 INFO L272 TraceCheckUtils]: 13: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,451 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,451 INFO L272 TraceCheckUtils]: 18: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,452 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 13:25:51,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,453 INFO L272 TraceCheckUtils]: 26: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,454 INFO L272 TraceCheckUtils]: 31: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,454 INFO L272 TraceCheckUtils]: 36: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,455 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,456 INFO L272 TraceCheckUtils]: 44: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,457 INFO L272 TraceCheckUtils]: 49: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,457 INFO L272 TraceCheckUtils]: 54: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,457 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,458 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post6 < 50);havoc #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,459 INFO L272 TraceCheckUtils]: 62: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,460 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,460 INFO L272 TraceCheckUtils]: 67: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #86#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 13:25:51,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,462 INFO L272 TraceCheckUtils]: 76: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,462 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,462 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #84#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,462 INFO L272 TraceCheckUtils]: 81: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:25:51,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:25:51,463 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:25:51,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:25:51,463 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #86#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,464 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} is VALID [2022-04-28 13:25:51,465 INFO L290 TraceCheckUtils]: 87: Hoare triple {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,465 INFO L290 TraceCheckUtils]: 88: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,465 INFO L290 TraceCheckUtils]: 89: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 13:25:51,466 INFO L272 TraceCheckUtils]: 90: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:25:51,466 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:25:51,466 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 13:25:51,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 13:25:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:25:51,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:26:22,008 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-28 13:26:22,008 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-28 13:26:22,008 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:26:22,009 INFO L272 TraceCheckUtils]: 90: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:26:22,009 INFO L290 TraceCheckUtils]: 89: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 50);havoc #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:26:22,010 INFO L290 TraceCheckUtils]: 88: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:26:22,023 INFO L290 TraceCheckUtils]: 87: Hoare triple {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:26:22,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 13:26:22,041 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:26:22,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,041 INFO L272 TraceCheckUtils]: 81: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,042 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:26:22,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,042 INFO L272 TraceCheckUtils]: 76: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 50);havoc #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:26:22,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:26:22,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 13:26:22,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:22,440 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #86#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,441 INFO L272 TraceCheckUtils]: 67: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,441 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,442 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,442 INFO L272 TraceCheckUtils]: 62: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post6 < 50);havoc #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,453 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,454 INFO L272 TraceCheckUtils]: 54: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,454 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,455 INFO L272 TraceCheckUtils]: 49: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,456 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:22,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:22,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:22,456 INFO L272 TraceCheckUtils]: 44: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:22,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post5 < 50);havoc #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:22,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:23,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 13:26:23,217 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #82#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,217 INFO L272 TraceCheckUtils]: 36: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,218 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,218 INFO L272 TraceCheckUtils]: 31: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,219 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,219 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 13:26:23,237 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,237 INFO L272 TraceCheckUtils]: 18: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,237 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,238 INFO L272 TraceCheckUtils]: 13: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,238 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-28 13:26:23,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-28 13:26:23,239 INFO L272 TraceCheckUtils]: 8: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-28 13:26:23,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(#t~post5 < 50);havoc #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 13:26:23,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-28 13:26:23,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-28 13:26:23,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-28 13:26:23,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-28 13:26:23,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-28 13:26:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 13:26:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:26:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729837947] [2022-04-28 13:26:23,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:26:23,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746995746] [2022-04-28 13:26:23,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746995746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:26:23,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:26:23,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 13:26:23,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:26:23,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469007579] [2022-04-28 13:26:23,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469007579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:26:23,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:26:23,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:26:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083758485] [2022-04-28 13:26:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:26:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 13:26:23,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:26:23,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:26:23,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:23,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:26:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:26:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:26:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:26:23,295 INFO L87 Difference]: Start difference. First operand 226 states and 263 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:26:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:24,636 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-28 13:26:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:26:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-28 13:26:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:26:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:26:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 13:26:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:26:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-28 13:26:24,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-28 13:26:24,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:24,784 INFO L225 Difference]: With dead ends: 275 [2022-04-28 13:26:24,784 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 13:26:24,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-04-28 13:26:24,785 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 13:26:24,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 13:26:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 13:26:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-28 13:26:25,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:26:25,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:26:25,020 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:26:25,020 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:26:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:25,024 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 13:26:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 13:26:25,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:25,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:25,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 13:26:25,025 INFO L87 Difference]: Start difference. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-28 13:26:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:26:25,028 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-28 13:26:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-28 13:26:25,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:26:25,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:26:25,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:26:25,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:26:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-28 13:26:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-28 13:26:25,032 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-28 13:26:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:26:25,033 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-28 13:26:25,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 13:26:25,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-28 13:26:25,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:26:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-28 13:26:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 13:26:25,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:26:25,348 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:26:25,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 13:26:25,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:26:25,549 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:26:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:26:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-28 13:26:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:26:25,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1702076067] [2022-04-28 13:26:28,205 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:26:28,205 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:26:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-28 13:26:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:26:28,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264390561] [2022-04-28 13:26:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:26:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:26:28,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:26:28,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30903916] [2022-04-28 13:26:28,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:26:28,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:26:28,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:26:28,222 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:26:28,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 13:26:28,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:26:28,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:26:28,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 13:26:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:26:28,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:28:49,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 13:28:49,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 13:28:49,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:49,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 13:28:49,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 50);havoc #t~post5; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 13:28:49,901 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:49,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:28:49,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:49,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:49,903 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22623#true} #82#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:28:50,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:50,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:50,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:50,286 INFO L272 TraceCheckUtils]: 26: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:50,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:50,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:50,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:50,287 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #78#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:50,287 INFO L272 TraceCheckUtils]: 31: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:50,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:50,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:50,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:50,288 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #80#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:50,288 INFO L272 TraceCheckUtils]: 36: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:50,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:50,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:50,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:50,289 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #82#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,291 WARN L290 TraceCheckUtils]: 41: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-28 13:28:52,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,293 INFO L272 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:52,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:52,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:52,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:52,293 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #78#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,294 INFO L272 TraceCheckUtils]: 49: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:52,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:52,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:52,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:52,294 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #80#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,295 INFO L272 TraceCheckUtils]: 54: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:52,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:52,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:52,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:52,295 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #82#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,297 INFO L272 TraceCheckUtils]: 62: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:52,297 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:52,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:52,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:52,298 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #84#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:52,298 INFO L272 TraceCheckUtils]: 67: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:52,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:28:52,298 INFO L290 TraceCheckUtils]: 69: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:52,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:52,299 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #86#return; {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 13:28:54,303 WARN L290 TraceCheckUtils]: 72: Hoare triple {22847#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~r~0 main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} is UNKNOWN [2022-04-28 13:28:54,328 INFO L290 TraceCheckUtils]: 73: Hoare triple {22851#(and (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))) (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-28 13:28:54,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-28 13:28:54,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} assume !!(#t~post6 < 50);havoc #t~post6; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-28 13:28:54,342 INFO L272 TraceCheckUtils]: 76: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:54,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:54,342 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:54,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:54,343 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #84#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-28 13:28:54,343 INFO L272 TraceCheckUtils]: 81: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:54,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:28:54,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:54,344 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:28:54,344 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} #86#return; {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} is VALID [2022-04-28 13:28:54,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {22855#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_mod_aux_div_v_main_~p~0_143_37_48 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= 0 aux_mod_aux_div_v_main_~p~0_143_37_48) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 2)) (< (* 4 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2) 2)) (<= (+ (* main_~p~0 2) (* aux_mod_aux_div_v_main_~p~0_143_37_48 2)) (* 4 aux_div_aux_div_v_main_~p~0_143_37_48)) (= main_~d~0 (div (+ (* (- 2) main_~B~0 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48) (* (- 1) main_~p~0))) (* main_~B~0 2 (+ (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (* (- 1) aux_mod_aux_div_v_main_~p~0_143_37_48)))) 2)) (< aux_mod_aux_div_v_main_~p~0_143_37_48 2))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-28 13:28:54,361 INFO L290 TraceCheckUtils]: 87: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-28 13:28:54,362 INFO L290 TraceCheckUtils]: 88: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-28 13:28:54,363 INFO L290 TraceCheckUtils]: 89: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} assume !!(#t~post6 < 50);havoc #t~post6; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-28 13:28:54,363 INFO L272 TraceCheckUtils]: 90: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:28:54,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:28:54,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:28:54,364 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:28:54,364 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} #84#return; {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} is VALID [2022-04-28 13:28:54,365 INFO L272 TraceCheckUtils]: 95: Hoare triple {22895#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* main_~B~0 main_~p~0) 4)) (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:28:54,365 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:28:54,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 13:28:54,366 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 13:28:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 100 proven. 53 refuted. 6 times theorem prover too weak. 265 trivial. 0 not checked. [2022-04-28 13:28:54,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:31:27,968 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-28 13:31:27,969 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-28 13:31:27,969 INFO L290 TraceCheckUtils]: 96: Hoare triple {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:31:27,970 INFO L272 TraceCheckUtils]: 95: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:31:27,970 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #84#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:31:27,971 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:27,971 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:27,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:27,971 INFO L272 TraceCheckUtils]: 90: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:27,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post6 < 50);havoc #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:31:27,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:31:27,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:31:27,991 INFO L290 TraceCheckUtils]: 86: Hoare triple {22970#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 13:31:28,004 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {22970#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} is VALID [2022-04-28 13:31:28,005 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:31:28,005 INFO L290 TraceCheckUtils]: 83: Hoare triple {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:31:28,006 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:31:28,006 INFO L272 TraceCheckUtils]: 81: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,006 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,006 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,006 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,007 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,007 INFO L272 TraceCheckUtils]: 76: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {23015#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22974#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,428 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {23015#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-28 13:31:28,429 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:31:28,429 INFO L290 TraceCheckUtils]: 69: Hoare triple {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:31:28,429 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22984#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:31:28,430 INFO L272 TraceCheckUtils]: 67: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,430 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,430 INFO L272 TraceCheckUtils]: 62: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23019#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-28 13:31:28,435 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #82#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,436 INFO L272 TraceCheckUtils]: 54: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,436 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #80#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L272 TraceCheckUtils]: 49: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #78#return; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,437 INFO L272 TraceCheckUtils]: 44: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23056#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-28 13:31:28,477 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #82#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,477 INFO L272 TraceCheckUtils]: 36: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,478 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #80#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,478 INFO L272 TraceCheckUtils]: 31: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,479 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #78#return; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,479 INFO L272 TraceCheckUtils]: 26: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(#t~post5 < 50);havoc #t~post5; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23111#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-28 13:31:28,485 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,485 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 50);havoc #t~post5; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-28 13:31:28,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-28 13:31:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 101 proven. 31 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-28 13:31:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:31:28,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264390561] [2022-04-28 13:31:28,487 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:31:28,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30903916] [2022-04-28 13:31:28,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30903916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:31:28,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:31:28,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2022-04-28 13:31:28,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:31:28,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1702076067] [2022-04-28 13:31:28,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1702076067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:31:28,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:31:28,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 13:31:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098504999] [2022-04-28 13:31:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:31:28,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 13:31:28,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:31:28,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:31:31,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 62 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 13:31:31,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 13:31:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:31:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 13:31:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=321, Unknown=4, NotChecked=0, Total=420 [2022-04-28 13:31:31,450 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:31:43,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:31:45,087 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-28 13:31:48,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:31:50,578 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-28 13:31:53,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:31:57,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:31:59,127 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-28 13:32:15,252 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-28 13:32:17,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:20,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:22,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:24,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:26,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:31,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:34,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:32:36,987 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-28 13:32:48,159 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-28 13:32:50,436 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-28 13:32:54,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:33:05,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:33:15,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:33:20,358 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-28 13:33:30,872 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-28 13:33:35,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 13:33:38,641 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-28 13:33:42,901 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-28 13:33:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:33:44,019 INFO L93 Difference]: Finished difference Result 261 states and 307 transitions. [2022-04-28 13:33:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 13:33:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-28 13:33:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:33:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:33:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-04-28 13:33:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:33:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-04-28 13:33:44,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 105 transitions. [2022-04-28 13:33:59,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 98 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 13:33:59,918 INFO L225 Difference]: With dead ends: 261 [2022-04-28 13:33:59,918 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 13:33:59,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 176 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=108, Invalid=394, Unknown=4, NotChecked=0, Total=506 [2022-04-28 13:33:59,919 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 13 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:33:59,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 291 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 312 Invalid, 14 Unknown, 76 Unchecked, 58.2s Time] [2022-04-28 13:33:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 13:34:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2022-04-28 13:34:00,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:34:00,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 13:34:00,262 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 13:34:00,262 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 13:34:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:00,266 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2022-04-28 13:34:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2022-04-28 13:34:00,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:00,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:00,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 259 states. [2022-04-28 13:34:00,267 INFO L87 Difference]: Start difference. First operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) Second operand 259 states. [2022-04-28 13:34:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:00,270 INFO L93 Difference]: Finished difference Result 259 states and 305 transitions. [2022-04-28 13:34:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 305 transitions. [2022-04-28 13:34:00,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:00,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:00,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:34:00,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:34:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 52 states have call successors, (52), 33 states have call predecessors, (52), 32 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 13:34:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 297 transitions. [2022-04-28 13:34:00,275 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 297 transitions. Word has length 99 [2022-04-28 13:34:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:34:00,275 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 297 transitions. [2022-04-28 13:34:00,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-28 13:34:00,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 297 transitions. [2022-04-28 13:34:00,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 297 transitions. [2022-04-28 13:34:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 13:34:00,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:34:00,843 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:34:00,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 13:34:01,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:34:01,043 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:34:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:34:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-28 13:34:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:01,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716164444] [2022-04-28 13:34:05,135 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:34:05,135 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:34:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-28 13:34:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:34:05,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340318994] [2022-04-28 13:34:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:34:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:34:05,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:34:05,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502449033] [2022-04-28 13:34:05,145 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:34:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:34:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:34:05,146 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:34:05,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 13:34:05,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:34:05,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:34:05,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:34:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:34:05,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:34:05,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {24794#true} call ULTIMATE.init(); {24794#true} is VALID [2022-04-28 13:34:05,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {24794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24794#true} is VALID [2022-04-28 13:34:05,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24794#true} {24794#true} #92#return; {24794#true} is VALID [2022-04-28 13:34:05,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {24794#true} call #t~ret7 := main(); {24794#true} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {24794#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {24814#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,560 INFO L272 TraceCheckUtils]: 8: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,561 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #78#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,561 INFO L272 TraceCheckUtils]: 13: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,561 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #80#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,562 INFO L272 TraceCheckUtils]: 18: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,562 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #82#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {24814#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {24814#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,563 INFO L272 TraceCheckUtils]: 26: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #78#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,564 INFO L272 TraceCheckUtils]: 31: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #80#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,564 INFO L272 TraceCheckUtils]: 36: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,565 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #82#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {24814#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {24814#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,566 INFO L272 TraceCheckUtils]: 44: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #78#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,567 INFO L272 TraceCheckUtils]: 49: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #80#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,567 INFO L272 TraceCheckUtils]: 54: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,568 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #82#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,568 INFO L290 TraceCheckUtils]: 59: Hoare triple {24814#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {24814#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,569 INFO L272 TraceCheckUtils]: 62: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,569 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #84#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,570 INFO L272 TraceCheckUtils]: 67: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,570 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #86#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {24814#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {24814#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {24814#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,571 INFO L272 TraceCheckUtils]: 76: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,572 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #84#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,572 INFO L272 TraceCheckUtils]: 81: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,572 INFO L290 TraceCheckUtils]: 82: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:05,572 INFO L290 TraceCheckUtils]: 83: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:05,572 INFO L290 TraceCheckUtils]: 84: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:05,573 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24794#true} {24814#(= main_~B~0 1)} #86#return; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,573 INFO L290 TraceCheckUtils]: 86: Hoare triple {24814#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {24814#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,573 INFO L290 TraceCheckUtils]: 88: Hoare triple {24814#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,574 INFO L290 TraceCheckUtils]: 89: Hoare triple {24814#(= main_~B~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24814#(= main_~B~0 1)} is VALID [2022-04-28 13:34:05,574 INFO L272 TraceCheckUtils]: 90: Hoare triple {24814#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,574 INFO L290 TraceCheckUtils]: 91: Hoare triple {24794#true} ~cond := #in~cond; {25073#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:34:05,574 INFO L290 TraceCheckUtils]: 92: Hoare triple {25073#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:05,575 INFO L290 TraceCheckUtils]: 93: Hoare triple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:05,575 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} {24814#(= main_~B~0 1)} #84#return; {25084#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-28 13:34:05,575 INFO L272 TraceCheckUtils]: 95: Hoare triple {25084#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:05,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {24794#true} ~cond := #in~cond; {25073#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:34:05,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {25073#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:05,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:05,577 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} {25084#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25100#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-28 13:34:05,578 INFO L290 TraceCheckUtils]: 100: Hoare triple {25100#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25104#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-28 13:34:05,578 INFO L272 TraceCheckUtils]: 101: Hoare triple {25104#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {25108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:34:05,579 INFO L290 TraceCheckUtils]: 102: Hoare triple {25108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:34:05,579 INFO L290 TraceCheckUtils]: 103: Hoare triple {25112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24795#false} is VALID [2022-04-28 13:34:05,579 INFO L290 TraceCheckUtils]: 104: Hoare triple {24795#false} assume !false; {24795#false} is VALID [2022-04-28 13:34:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 13:34:05,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:34:41,720 INFO L290 TraceCheckUtils]: 104: Hoare triple {24795#false} assume !false; {24795#false} is VALID [2022-04-28 13:34:41,721 INFO L290 TraceCheckUtils]: 103: Hoare triple {25112#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24795#false} is VALID [2022-04-28 13:34:41,721 INFO L290 TraceCheckUtils]: 102: Hoare triple {25108#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25112#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:34:41,722 INFO L272 TraceCheckUtils]: 101: Hoare triple {25128#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {25108#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:34:41,722 INFO L290 TraceCheckUtils]: 100: Hoare triple {25132#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {25128#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:34:41,724 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} {25136#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #86#return; {25132#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 13:34:41,724 INFO L290 TraceCheckUtils]: 98: Hoare triple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:41,724 INFO L290 TraceCheckUtils]: 97: Hoare triple {25146#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:41,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {24794#true} ~cond := #in~cond; {25146#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:34:41,725 INFO L272 TraceCheckUtils]: 95: Hoare triple {25136#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,725 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} {24794#true} #84#return; {25136#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 13:34:41,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:41,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {25146#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25077#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:34:41,726 INFO L290 TraceCheckUtils]: 91: Hoare triple {24794#true} ~cond := #in~cond; {25146#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:34:41,726 INFO L272 TraceCheckUtils]: 90: Hoare triple {24794#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,726 INFO L290 TraceCheckUtils]: 89: Hoare triple {24794#true} assume !!(#t~post6 < 50);havoc #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {24794#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {24794#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 86: Hoare triple {24794#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); {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24794#true} {24794#true} #86#return; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 84: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 83: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 82: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L272 TraceCheckUtils]: 81: Hoare triple {24794#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24794#true} {24794#true} #84#return; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L272 TraceCheckUtils]: 76: Hoare triple {24794#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {24794#true} assume !!(#t~post6 < 50);havoc #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {24794#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {24794#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {24794#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); {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24794#true} {24794#true} #86#return; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L272 TraceCheckUtils]: 67: Hoare triple {24794#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24794#true} {24794#true} #84#return; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 64: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L272 TraceCheckUtils]: 62: Hoare triple {24794#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {24794#true} assume !!(#t~post6 < 50);havoc #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {24794#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24794#true} is VALID [2022-04-28 13:34:41,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {24794#true} assume !(~r~0 >= ~d~0); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24794#true} {24794#true} #82#return; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L272 TraceCheckUtils]: 54: Hoare triple {24794#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24794#true} {24794#true} #80#return; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L272 TraceCheckUtils]: 49: Hoare triple {24794#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24794#true} {24794#true} #78#return; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,729 INFO L272 TraceCheckUtils]: 44: Hoare triple {24794#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {24794#true} assume !!(#t~post5 < 50);havoc #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {24794#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {24794#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24794#true} {24794#true} #82#return; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L272 TraceCheckUtils]: 36: Hoare triple {24794#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24794#true} {24794#true} #80#return; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L272 TraceCheckUtils]: 31: Hoare triple {24794#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24794#true} {24794#true} #78#return; {24794#true} is VALID [2022-04-28 13:34:41,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L272 TraceCheckUtils]: 26: Hoare triple {24794#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {24794#true} assume !!(#t~post5 < 50);havoc #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {24794#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {24794#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24794#true} {24794#true} #82#return; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L272 TraceCheckUtils]: 18: Hoare triple {24794#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24794#true} {24794#true} #80#return; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L272 TraceCheckUtils]: 13: Hoare triple {24794#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24794#true} {24794#true} #78#return; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {24794#true} assume !(0 == ~cond); {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {24794#true} ~cond := #in~cond; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L272 TraceCheckUtils]: 8: Hoare triple {24794#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {24794#true} assume !!(#t~post5 < 50);havoc #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {24794#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {24794#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {24794#true} call #t~ret7 := main(); {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24794#true} {24794#true} #92#return; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {24794#true} assume true; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {24794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24794#true} is VALID [2022-04-28 13:34:41,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {24794#true} call ULTIMATE.init(); {24794#true} is VALID [2022-04-28 13:34:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 13:34:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:34:41,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340318994] [2022-04-28 13:34:41,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:34:41,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502449033] [2022-04-28 13:34:41,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502449033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:34:41,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:34:41,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 13:34:41,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:34:41,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716164444] [2022-04-28 13:34:41,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716164444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:34:41,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:34:41,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:34:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207133742] [2022-04-28 13:34:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:34:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 13:34:41,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:34:41,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:34:41,767 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-28 13:34:41,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:34:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:34:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:34:41,767 INFO L87 Difference]: Start difference. First operand 254 states and 297 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:34:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:42,795 INFO L93 Difference]: Finished difference Result 271 states and 313 transitions. [2022-04-28 13:34:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:34:42,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 105 [2022-04-28 13:34:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:34:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:34:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 13:34:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:34:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 13:34:42,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 13:34:42,850 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-28 13:34:42,854 INFO L225 Difference]: With dead ends: 271 [2022-04-28 13:34:42,854 INFO L226 Difference]: Without dead ends: 266 [2022-04-28 13:34:42,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:34:42,854 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:34:42,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 109 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 13:34:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-28 13:34:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 249. [2022-04-28 13:34:43,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:34:43,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 13:34:43,140 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 13:34:43,141 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 13:34:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:43,144 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2022-04-28 13:34:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 302 transitions. [2022-04-28 13:34:43,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:43,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 266 states. [2022-04-28 13:34:43,145 INFO L87 Difference]: Start difference. First operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) Second operand 266 states. [2022-04-28 13:34:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:43,148 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2022-04-28 13:34:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 302 transitions. [2022-04-28 13:34:43,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:43,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:43,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:34:43,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:34:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 167 states have (on average 1.1137724550898203) internal successors, (186), 172 states have internal predecessors, (186), 47 states have call successors, (47), 35 states have call predecessors, (47), 34 states have return successors, (45), 41 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 13:34:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 278 transitions. [2022-04-28 13:34:43,152 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 278 transitions. Word has length 105 [2022-04-28 13:34:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:34:43,153 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 278 transitions. [2022-04-28 13:34:43,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 13:34:43,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 249 states and 278 transitions. [2022-04-28 13:34:43,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 278 transitions. [2022-04-28 13:34:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 13:34:43,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:34:43,732 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:34:43,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 13:34:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 13:34:43,932 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:34:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:34:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 7 times [2022-04-28 13:34:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:43,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330394538] [2022-04-28 13:34:46,353 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:34:46,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:34:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1894816690, now seen corresponding path program 8 times [2022-04-28 13:34:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:34:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208633969] [2022-04-28 13:34:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:34:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:34:46,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:34:46,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997817894] [2022-04-28 13:34:46,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:34:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:34:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:34:46,377 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:34:46,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 13:34:46,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:34:46,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:34:46,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:34:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:34:46,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:34:47,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {27017#true} call ULTIMATE.init(); {27017#true} is VALID [2022-04-28 13:34:47,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {27017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27025#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:47,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {27025#(<= ~counter~0 0)} assume true; {27025#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:47,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27025#(<= ~counter~0 0)} {27017#true} #92#return; {27025#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:47,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {27025#(<= ~counter~0 0)} call #t~ret7 := main(); {27025#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:47,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {27025#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27025#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:47,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {27025#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {27041#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,024 INFO L272 TraceCheckUtils]: 8: Hoare triple {27041#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {27041#(<= ~counter~0 1)} ~cond := #in~cond; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {27041#(<= ~counter~0 1)} assume !(0 == ~cond); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {27041#(<= ~counter~0 1)} assume true; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,025 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27041#(<= ~counter~0 1)} {27041#(<= ~counter~0 1)} #78#return; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,026 INFO L272 TraceCheckUtils]: 13: Hoare triple {27041#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {27041#(<= ~counter~0 1)} ~cond := #in~cond; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {27041#(<= ~counter~0 1)} assume !(0 == ~cond); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {27041#(<= ~counter~0 1)} assume true; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,027 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27041#(<= ~counter~0 1)} {27041#(<= ~counter~0 1)} #80#return; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,027 INFO L272 TraceCheckUtils]: 18: Hoare triple {27041#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {27041#(<= ~counter~0 1)} ~cond := #in~cond; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {27041#(<= ~counter~0 1)} assume !(0 == ~cond); {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {27041#(<= ~counter~0 1)} assume true; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,029 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27041#(<= ~counter~0 1)} {27041#(<= ~counter~0 1)} #82#return; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {27041#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27041#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:47,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {27041#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {27096#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,031 INFO L272 TraceCheckUtils]: 26: Hoare triple {27096#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {27096#(<= ~counter~0 2)} ~cond := #in~cond; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {27096#(<= ~counter~0 2)} assume !(0 == ~cond); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {27096#(<= ~counter~0 2)} assume true; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,032 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27096#(<= ~counter~0 2)} {27096#(<= ~counter~0 2)} #78#return; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,032 INFO L272 TraceCheckUtils]: 31: Hoare triple {27096#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {27096#(<= ~counter~0 2)} ~cond := #in~cond; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {27096#(<= ~counter~0 2)} assume !(0 == ~cond); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {27096#(<= ~counter~0 2)} assume true; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,033 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27096#(<= ~counter~0 2)} {27096#(<= ~counter~0 2)} #80#return; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,034 INFO L272 TraceCheckUtils]: 36: Hoare triple {27096#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {27096#(<= ~counter~0 2)} ~cond := #in~cond; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {27096#(<= ~counter~0 2)} assume !(0 == ~cond); {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {27096#(<= ~counter~0 2)} assume true; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,035 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27096#(<= ~counter~0 2)} {27096#(<= ~counter~0 2)} #82#return; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {27096#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27096#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:47,036 INFO L290 TraceCheckUtils]: 42: Hoare triple {27096#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {27151#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,037 INFO L272 TraceCheckUtils]: 44: Hoare triple {27151#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {27151#(<= ~counter~0 3)} ~cond := #in~cond; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {27151#(<= ~counter~0 3)} assume !(0 == ~cond); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {27151#(<= ~counter~0 3)} assume true; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,038 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27151#(<= ~counter~0 3)} {27151#(<= ~counter~0 3)} #78#return; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,039 INFO L272 TraceCheckUtils]: 49: Hoare triple {27151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {27151#(<= ~counter~0 3)} ~cond := #in~cond; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {27151#(<= ~counter~0 3)} assume !(0 == ~cond); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {27151#(<= ~counter~0 3)} assume true; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,040 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27151#(<= ~counter~0 3)} {27151#(<= ~counter~0 3)} #80#return; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,040 INFO L272 TraceCheckUtils]: 54: Hoare triple {27151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {27151#(<= ~counter~0 3)} ~cond := #in~cond; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {27151#(<= ~counter~0 3)} assume !(0 == ~cond); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {27151#(<= ~counter~0 3)} assume true; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,042 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27151#(<= ~counter~0 3)} {27151#(<= ~counter~0 3)} #82#return; {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {27151#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {27151#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:47,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {27151#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {27206#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,044 INFO L272 TraceCheckUtils]: 62: Hoare triple {27206#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {27206#(<= ~counter~0 4)} ~cond := #in~cond; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {27206#(<= ~counter~0 4)} assume !(0 == ~cond); {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {27206#(<= ~counter~0 4)} assume true; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,045 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27206#(<= ~counter~0 4)} {27206#(<= ~counter~0 4)} #84#return; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,045 INFO L272 TraceCheckUtils]: 67: Hoare triple {27206#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {27206#(<= ~counter~0 4)} ~cond := #in~cond; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {27206#(<= ~counter~0 4)} assume !(0 == ~cond); {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {27206#(<= ~counter~0 4)} assume true; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,047 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27206#(<= ~counter~0 4)} {27206#(<= ~counter~0 4)} #86#return; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {27206#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {27206#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27206#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:47,048 INFO L290 TraceCheckUtils]: 74: Hoare triple {27206#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {27249#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,049 INFO L272 TraceCheckUtils]: 76: Hoare triple {27249#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,049 INFO L290 TraceCheckUtils]: 77: Hoare triple {27249#(<= ~counter~0 5)} ~cond := #in~cond; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,049 INFO L290 TraceCheckUtils]: 78: Hoare triple {27249#(<= ~counter~0 5)} assume !(0 == ~cond); {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,049 INFO L290 TraceCheckUtils]: 79: Hoare triple {27249#(<= ~counter~0 5)} assume true; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,050 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27249#(<= ~counter~0 5)} {27249#(<= ~counter~0 5)} #84#return; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,050 INFO L272 TraceCheckUtils]: 81: Hoare triple {27249#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {27249#(<= ~counter~0 5)} ~cond := #in~cond; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {27249#(<= ~counter~0 5)} assume !(0 == ~cond); {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {27249#(<= ~counter~0 5)} assume true; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,052 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27249#(<= ~counter~0 5)} {27249#(<= ~counter~0 5)} #86#return; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,052 INFO L290 TraceCheckUtils]: 86: Hoare triple {27249#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,052 INFO L290 TraceCheckUtils]: 87: Hoare triple {27249#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27249#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:47,053 INFO L290 TraceCheckUtils]: 88: Hoare triple {27249#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,053 INFO L290 TraceCheckUtils]: 89: Hoare triple {27292#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,054 INFO L272 TraceCheckUtils]: 90: Hoare triple {27292#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,054 INFO L290 TraceCheckUtils]: 91: Hoare triple {27292#(<= ~counter~0 6)} ~cond := #in~cond; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,054 INFO L290 TraceCheckUtils]: 92: Hoare triple {27292#(<= ~counter~0 6)} assume !(0 == ~cond); {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {27292#(<= ~counter~0 6)} assume true; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,055 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27292#(<= ~counter~0 6)} {27292#(<= ~counter~0 6)} #84#return; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,056 INFO L272 TraceCheckUtils]: 95: Hoare triple {27292#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,056 INFO L290 TraceCheckUtils]: 96: Hoare triple {27292#(<= ~counter~0 6)} ~cond := #in~cond; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,056 INFO L290 TraceCheckUtils]: 97: Hoare triple {27292#(<= ~counter~0 6)} assume !(0 == ~cond); {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,056 INFO L290 TraceCheckUtils]: 98: Hoare triple {27292#(<= ~counter~0 6)} assume true; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,057 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27292#(<= ~counter~0 6)} {27292#(<= ~counter~0 6)} #86#return; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,057 INFO L290 TraceCheckUtils]: 100: Hoare triple {27292#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,057 INFO L290 TraceCheckUtils]: 101: Hoare triple {27292#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27292#(<= ~counter~0 6)} is VALID [2022-04-28 13:34:47,058 INFO L290 TraceCheckUtils]: 102: Hoare triple {27292#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27335#(<= |main_#t~post6| 6)} is VALID [2022-04-28 13:34:47,058 INFO L290 TraceCheckUtils]: 103: Hoare triple {27335#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {27018#false} is VALID [2022-04-28 13:34:47,058 INFO L272 TraceCheckUtils]: 104: Hoare triple {27018#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27018#false} is VALID [2022-04-28 13:34:47,058 INFO L290 TraceCheckUtils]: 105: Hoare triple {27018#false} ~cond := #in~cond; {27018#false} is VALID [2022-04-28 13:34:47,058 INFO L290 TraceCheckUtils]: 106: Hoare triple {27018#false} assume 0 == ~cond; {27018#false} is VALID [2022-04-28 13:34:47,058 INFO L290 TraceCheckUtils]: 107: Hoare triple {27018#false} assume !false; {27018#false} is VALID [2022-04-28 13:34:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 414 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 13:34:47,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:34:47,549 INFO L290 TraceCheckUtils]: 107: Hoare triple {27018#false} assume !false; {27018#false} is VALID [2022-04-28 13:34:47,549 INFO L290 TraceCheckUtils]: 106: Hoare triple {27018#false} assume 0 == ~cond; {27018#false} is VALID [2022-04-28 13:34:47,549 INFO L290 TraceCheckUtils]: 105: Hoare triple {27018#false} ~cond := #in~cond; {27018#false} is VALID [2022-04-28 13:34:47,549 INFO L272 TraceCheckUtils]: 104: Hoare triple {27018#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {27018#false} is VALID [2022-04-28 13:34:47,549 INFO L290 TraceCheckUtils]: 103: Hoare triple {27363#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {27018#false} is VALID [2022-04-28 13:34:47,550 INFO L290 TraceCheckUtils]: 102: Hoare triple {27367#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27363#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:34:47,550 INFO L290 TraceCheckUtils]: 101: Hoare triple {27367#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,550 INFO L290 TraceCheckUtils]: 100: Hoare triple {27367#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,551 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27017#true} {27367#(< ~counter~0 50)} #86#return; {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 98: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 97: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 96: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L272 TraceCheckUtils]: 95: Hoare triple {27367#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27017#true} {27367#(< ~counter~0 50)} #84#return; {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 93: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 92: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,551 INFO L290 TraceCheckUtils]: 91: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,552 INFO L272 TraceCheckUtils]: 90: Hoare triple {27367#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,552 INFO L290 TraceCheckUtils]: 89: Hoare triple {27367#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,553 INFO L290 TraceCheckUtils]: 88: Hoare triple {27410#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27367#(< ~counter~0 50)} is VALID [2022-04-28 13:34:47,553 INFO L290 TraceCheckUtils]: 87: Hoare triple {27410#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,553 INFO L290 TraceCheckUtils]: 86: Hoare triple {27410#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,554 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27017#true} {27410#(< ~counter~0 49)} #86#return; {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,554 INFO L290 TraceCheckUtils]: 84: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,554 INFO L290 TraceCheckUtils]: 83: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,554 INFO L272 TraceCheckUtils]: 81: Hoare triple {27410#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,557 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27017#true} {27410#(< ~counter~0 49)} #84#return; {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,557 INFO L290 TraceCheckUtils]: 79: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,557 INFO L290 TraceCheckUtils]: 78: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,557 INFO L290 TraceCheckUtils]: 77: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,557 INFO L272 TraceCheckUtils]: 76: Hoare triple {27410#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,557 INFO L290 TraceCheckUtils]: 75: Hoare triple {27410#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {27453#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27410#(< ~counter~0 49)} is VALID [2022-04-28 13:34:47,558 INFO L290 TraceCheckUtils]: 73: Hoare triple {27453#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {27453#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,559 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27017#true} {27453#(< ~counter~0 48)} #86#return; {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,559 INFO L290 TraceCheckUtils]: 68: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,559 INFO L272 TraceCheckUtils]: 67: Hoare triple {27453#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,560 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {27017#true} {27453#(< ~counter~0 48)} #84#return; {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,560 INFO L272 TraceCheckUtils]: 62: Hoare triple {27453#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {27453#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {27496#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27453#(< ~counter~0 48)} is VALID [2022-04-28 13:34:47,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {27496#(< ~counter~0 47)} assume !(~r~0 >= ~d~0); {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,562 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {27017#true} {27496#(< ~counter~0 47)} #82#return; {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,562 INFO L272 TraceCheckUtils]: 54: Hoare triple {27496#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,563 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27017#true} {27496#(< ~counter~0 47)} #80#return; {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,563 INFO L272 TraceCheckUtils]: 49: Hoare triple {27496#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,563 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {27017#true} {27496#(< ~counter~0 47)} #78#return; {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,564 INFO L272 TraceCheckUtils]: 44: Hoare triple {27496#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,564 INFO L290 TraceCheckUtils]: 43: Hoare triple {27496#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {27551#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27496#(< ~counter~0 47)} is VALID [2022-04-28 13:34:47,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {27551#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,565 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27017#true} {27551#(< ~counter~0 46)} #82#return; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,565 INFO L272 TraceCheckUtils]: 36: Hoare triple {27551#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,566 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27017#true} {27551#(< ~counter~0 46)} #80#return; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,566 INFO L290 TraceCheckUtils]: 34: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,566 INFO L272 TraceCheckUtils]: 31: Hoare triple {27551#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,566 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {27017#true} {27551#(< ~counter~0 46)} #78#return; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,567 INFO L272 TraceCheckUtils]: 26: Hoare triple {27551#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {27551#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {27606#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27551#(< ~counter~0 46)} is VALID [2022-04-28 13:34:47,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {27606#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,568 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27017#true} {27606#(< ~counter~0 45)} #82#return; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,568 INFO L272 TraceCheckUtils]: 18: Hoare triple {27606#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,572 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27017#true} {27606#(< ~counter~0 45)} #80#return; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {27606#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,573 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {27017#true} {27606#(< ~counter~0 45)} #78#return; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {27017#true} assume true; {27017#true} is VALID [2022-04-28 13:34:47,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {27017#true} assume !(0 == ~cond); {27017#true} is VALID [2022-04-28 13:34:47,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {27017#true} ~cond := #in~cond; {27017#true} is VALID [2022-04-28 13:34:47,573 INFO L272 TraceCheckUtils]: 8: Hoare triple {27606#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27017#true} is VALID [2022-04-28 13:34:47,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {27606#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {27661#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27606#(< ~counter~0 45)} is VALID [2022-04-28 13:34:47,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {27661#(< ~counter~0 44)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {27661#(< ~counter~0 44)} is VALID [2022-04-28 13:34:47,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {27661#(< ~counter~0 44)} call #t~ret7 := main(); {27661#(< ~counter~0 44)} is VALID [2022-04-28 13:34:47,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27661#(< ~counter~0 44)} {27017#true} #92#return; {27661#(< ~counter~0 44)} is VALID [2022-04-28 13:34:47,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {27661#(< ~counter~0 44)} assume true; {27661#(< ~counter~0 44)} is VALID [2022-04-28 13:34:47,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {27017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27661#(< ~counter~0 44)} is VALID [2022-04-28 13:34:47,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {27017#true} call ULTIMATE.init(); {27017#true} is VALID [2022-04-28 13:34:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 13:34:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:34:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208633969] [2022-04-28 13:34:47,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:34:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997817894] [2022-04-28 13:34:47,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997817894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:34:47,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:34:47,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 13:34:47,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:34:47,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330394538] [2022-04-28 13:34:47,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330394538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:34:47,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:34:47,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:34:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137475825] [2022-04-28 13:34:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:34:47,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 13:34:47,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:34:47,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:34:47,654 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-28 13:34:47,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:34:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:34:47,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:34:47,655 INFO L87 Difference]: Start difference. First operand 249 states and 278 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:34:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:48,533 INFO L93 Difference]: Finished difference Result 325 states and 364 transitions. [2022-04-28 13:34:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 13:34:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 108 [2022-04-28 13:34:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:34:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:34:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 13:34:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:34:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-04-28 13:34:48,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 149 transitions. [2022-04-28 13:34:48,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:48,624 INFO L225 Difference]: With dead ends: 325 [2022-04-28 13:34:48,624 INFO L226 Difference]: Without dead ends: 312 [2022-04-28 13:34:48,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=253, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:34:48,625 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:34:48,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 197 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:34:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-28 13:34:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2022-04-28 13:34:49,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:34:49,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:49,079 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:49,079 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:49,083 INFO L93 Difference]: Finished difference Result 312 states and 344 transitions. [2022-04-28 13:34:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 344 transitions. [2022-04-28 13:34:49,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:49,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:49,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 312 states. [2022-04-28 13:34:49,085 INFO L87 Difference]: Start difference. First operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 312 states. [2022-04-28 13:34:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:49,088 INFO L93 Difference]: Finished difference Result 312 states and 344 transitions. [2022-04-28 13:34:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 344 transitions. [2022-04-28 13:34:49,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:49,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:49,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:34:49,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:34:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 214 states have (on average 1.1074766355140186) internal successors, (237), 218 states have internal predecessors, (237), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 343 transitions. [2022-04-28 13:34:49,094 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 343 transitions. Word has length 108 [2022-04-28 13:34:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:34:49,094 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 343 transitions. [2022-04-28 13:34:49,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 9 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 13:34:49,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 311 states and 343 transitions. [2022-04-28 13:34:49,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 343 transitions. [2022-04-28 13:34:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-28 13:34:49,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:34:49,814 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:34:49,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 13:34:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 13:34:50,014 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:34:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:34:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 1 times [2022-04-28 13:34:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414467497] [2022-04-28 13:34:54,099 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:34:54,099 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:34:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 522560651, now seen corresponding path program 2 times [2022-04-28 13:34:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:34:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376039170] [2022-04-28 13:34:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:34:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:34:54,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:34:54,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176988365] [2022-04-28 13:34:54,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:34:54,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:34:54,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:34:54,113 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:34:54,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 13:34:54,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:34:54,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:34:54,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:34:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:34:54,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:34:54,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {29584#true} call ULTIMATE.init(); {29584#true} is VALID [2022-04-28 13:34:54,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {29584#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29592#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:54,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {29592#(<= ~counter~0 0)} assume true; {29592#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:54,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29592#(<= ~counter~0 0)} {29584#true} #92#return; {29592#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:54,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {29592#(<= ~counter~0 0)} call #t~ret7 := main(); {29592#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:54,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {29592#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {29592#(<= ~counter~0 0)} is VALID [2022-04-28 13:34:54,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {29592#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {29608#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,726 INFO L272 TraceCheckUtils]: 8: Hoare triple {29608#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {29608#(<= ~counter~0 1)} ~cond := #in~cond; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {29608#(<= ~counter~0 1)} assume !(0 == ~cond); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {29608#(<= ~counter~0 1)} assume true; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,728 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29608#(<= ~counter~0 1)} {29608#(<= ~counter~0 1)} #78#return; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {29608#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {29608#(<= ~counter~0 1)} ~cond := #in~cond; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {29608#(<= ~counter~0 1)} assume !(0 == ~cond); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {29608#(<= ~counter~0 1)} assume true; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,729 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29608#(<= ~counter~0 1)} {29608#(<= ~counter~0 1)} #80#return; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {29608#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {29608#(<= ~counter~0 1)} ~cond := #in~cond; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {29608#(<= ~counter~0 1)} assume !(0 == ~cond); {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {29608#(<= ~counter~0 1)} assume true; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,731 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29608#(<= ~counter~0 1)} {29608#(<= ~counter~0 1)} #82#return; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {29608#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29608#(<= ~counter~0 1)} is VALID [2022-04-28 13:34:54,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {29608#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {29663#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,733 INFO L272 TraceCheckUtils]: 26: Hoare triple {29663#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {29663#(<= ~counter~0 2)} ~cond := #in~cond; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {29663#(<= ~counter~0 2)} assume !(0 == ~cond); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {29663#(<= ~counter~0 2)} assume true; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,734 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29663#(<= ~counter~0 2)} {29663#(<= ~counter~0 2)} #78#return; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,734 INFO L272 TraceCheckUtils]: 31: Hoare triple {29663#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {29663#(<= ~counter~0 2)} ~cond := #in~cond; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {29663#(<= ~counter~0 2)} assume !(0 == ~cond); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {29663#(<= ~counter~0 2)} assume true; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,735 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29663#(<= ~counter~0 2)} {29663#(<= ~counter~0 2)} #80#return; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,736 INFO L272 TraceCheckUtils]: 36: Hoare triple {29663#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {29663#(<= ~counter~0 2)} ~cond := #in~cond; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {29663#(<= ~counter~0 2)} assume !(0 == ~cond); {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {29663#(<= ~counter~0 2)} assume true; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,737 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29663#(<= ~counter~0 2)} {29663#(<= ~counter~0 2)} #82#return; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {29663#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29663#(<= ~counter~0 2)} is VALID [2022-04-28 13:34:54,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {29663#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {29718#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,739 INFO L272 TraceCheckUtils]: 44: Hoare triple {29718#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {29718#(<= ~counter~0 3)} ~cond := #in~cond; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {29718#(<= ~counter~0 3)} assume !(0 == ~cond); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {29718#(<= ~counter~0 3)} assume true; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,740 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29718#(<= ~counter~0 3)} {29718#(<= ~counter~0 3)} #78#return; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,740 INFO L272 TraceCheckUtils]: 49: Hoare triple {29718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {29718#(<= ~counter~0 3)} ~cond := #in~cond; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {29718#(<= ~counter~0 3)} assume !(0 == ~cond); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {29718#(<= ~counter~0 3)} assume true; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,742 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29718#(<= ~counter~0 3)} {29718#(<= ~counter~0 3)} #80#return; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,742 INFO L272 TraceCheckUtils]: 54: Hoare triple {29718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {29718#(<= ~counter~0 3)} ~cond := #in~cond; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {29718#(<= ~counter~0 3)} assume !(0 == ~cond); {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {29718#(<= ~counter~0 3)} assume true; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,743 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29718#(<= ~counter~0 3)} {29718#(<= ~counter~0 3)} #82#return; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {29718#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29718#(<= ~counter~0 3)} is VALID [2022-04-28 13:34:54,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {29718#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {29773#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {29773#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {29773#(<= ~counter~0 4)} ~cond := #in~cond; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {29773#(<= ~counter~0 4)} assume !(0 == ~cond); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {29773#(<= ~counter~0 4)} assume true; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,746 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29773#(<= ~counter~0 4)} {29773#(<= ~counter~0 4)} #78#return; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,747 INFO L272 TraceCheckUtils]: 67: Hoare triple {29773#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,747 INFO L290 TraceCheckUtils]: 68: Hoare triple {29773#(<= ~counter~0 4)} ~cond := #in~cond; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {29773#(<= ~counter~0 4)} assume !(0 == ~cond); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,747 INFO L290 TraceCheckUtils]: 70: Hoare triple {29773#(<= ~counter~0 4)} assume true; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,748 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29773#(<= ~counter~0 4)} {29773#(<= ~counter~0 4)} #80#return; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,748 INFO L272 TraceCheckUtils]: 72: Hoare triple {29773#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {29773#(<= ~counter~0 4)} ~cond := #in~cond; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {29773#(<= ~counter~0 4)} assume !(0 == ~cond); {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {29773#(<= ~counter~0 4)} assume true; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,749 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29773#(<= ~counter~0 4)} {29773#(<= ~counter~0 4)} #82#return; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {29773#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29773#(<= ~counter~0 4)} is VALID [2022-04-28 13:34:54,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {29773#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {29828#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,751 INFO L272 TraceCheckUtils]: 80: Hoare triple {29828#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,751 INFO L290 TraceCheckUtils]: 81: Hoare triple {29828#(<= ~counter~0 5)} ~cond := #in~cond; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {29828#(<= ~counter~0 5)} assume !(0 == ~cond); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {29828#(<= ~counter~0 5)} assume true; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,752 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29828#(<= ~counter~0 5)} {29828#(<= ~counter~0 5)} #78#return; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,753 INFO L272 TraceCheckUtils]: 85: Hoare triple {29828#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,753 INFO L290 TraceCheckUtils]: 86: Hoare triple {29828#(<= ~counter~0 5)} ~cond := #in~cond; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,753 INFO L290 TraceCheckUtils]: 87: Hoare triple {29828#(<= ~counter~0 5)} assume !(0 == ~cond); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,753 INFO L290 TraceCheckUtils]: 88: Hoare triple {29828#(<= ~counter~0 5)} assume true; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,754 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29828#(<= ~counter~0 5)} {29828#(<= ~counter~0 5)} #80#return; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,754 INFO L272 TraceCheckUtils]: 90: Hoare triple {29828#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,755 INFO L290 TraceCheckUtils]: 91: Hoare triple {29828#(<= ~counter~0 5)} ~cond := #in~cond; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,755 INFO L290 TraceCheckUtils]: 92: Hoare triple {29828#(<= ~counter~0 5)} assume !(0 == ~cond); {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,755 INFO L290 TraceCheckUtils]: 93: Hoare triple {29828#(<= ~counter~0 5)} assume true; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,755 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29828#(<= ~counter~0 5)} {29828#(<= ~counter~0 5)} #82#return; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,756 INFO L290 TraceCheckUtils]: 95: Hoare triple {29828#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29828#(<= ~counter~0 5)} is VALID [2022-04-28 13:34:54,756 INFO L290 TraceCheckUtils]: 96: Hoare triple {29828#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {29883#(<= |main_#t~post5| 5)} is VALID [2022-04-28 13:34:54,756 INFO L290 TraceCheckUtils]: 97: Hoare triple {29883#(<= |main_#t~post5| 5)} assume !(#t~post5 < 50);havoc #t~post5; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 98: Hoare triple {29585#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 99: Hoare triple {29585#false} assume !!(#t~post6 < 50);havoc #t~post6; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L272 TraceCheckUtils]: 100: Hoare triple {29585#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 101: Hoare triple {29585#false} ~cond := #in~cond; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 102: Hoare triple {29585#false} assume !(0 == ~cond); {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 103: Hoare triple {29585#false} assume true; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29585#false} {29585#false} #84#return; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L272 TraceCheckUtils]: 105: Hoare triple {29585#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 106: Hoare triple {29585#false} ~cond := #in~cond; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 107: Hoare triple {29585#false} assume !(0 == ~cond); {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 108: Hoare triple {29585#false} assume true; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29585#false} {29585#false} #86#return; {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 110: Hoare triple {29585#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29585#false} is VALID [2022-04-28 13:34:54,757 INFO L290 TraceCheckUtils]: 111: Hoare triple {29585#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L290 TraceCheckUtils]: 112: Hoare triple {29585#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L290 TraceCheckUtils]: 113: Hoare triple {29585#false} assume !(#t~post6 < 50);havoc #t~post6; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L272 TraceCheckUtils]: 114: Hoare triple {29585#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L290 TraceCheckUtils]: 115: Hoare triple {29585#false} ~cond := #in~cond; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L290 TraceCheckUtils]: 116: Hoare triple {29585#false} assume 0 == ~cond; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L290 TraceCheckUtils]: 117: Hoare triple {29585#false} assume !false; {29585#false} is VALID [2022-04-28 13:34:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 150 proven. 430 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 13:34:54,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:34:55,271 INFO L290 TraceCheckUtils]: 117: Hoare triple {29585#false} assume !false; {29585#false} is VALID [2022-04-28 13:34:55,271 INFO L290 TraceCheckUtils]: 116: Hoare triple {29585#false} assume 0 == ~cond; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {29585#false} ~cond := #in~cond; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L272 TraceCheckUtils]: 114: Hoare triple {29585#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 113: Hoare triple {29585#false} assume !(#t~post6 < 50);havoc #t~post6; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 112: Hoare triple {29585#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 111: Hoare triple {29585#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {29585#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {29584#true} {29585#false} #86#return; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 108: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 107: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 106: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L272 TraceCheckUtils]: 105: Hoare triple {29585#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29584#true} {29585#false} #84#return; {29585#false} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 103: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 102: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,272 INFO L290 TraceCheckUtils]: 101: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,273 INFO L272 TraceCheckUtils]: 100: Hoare triple {29585#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,273 INFO L290 TraceCheckUtils]: 99: Hoare triple {29585#false} assume !!(#t~post6 < 50);havoc #t~post6; {29585#false} is VALID [2022-04-28 13:34:55,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {29585#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29585#false} is VALID [2022-04-28 13:34:55,273 INFO L290 TraceCheckUtils]: 97: Hoare triple {30007#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {29585#false} is VALID [2022-04-28 13:34:55,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {30011#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30007#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:34:55,274 INFO L290 TraceCheckUtils]: 95: Hoare triple {30011#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,274 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {29584#true} {30011#(< ~counter~0 50)} #82#return; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,274 INFO L290 TraceCheckUtils]: 92: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,274 INFO L290 TraceCheckUtils]: 91: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,274 INFO L272 TraceCheckUtils]: 90: Hoare triple {30011#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,275 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {29584#true} {30011#(< ~counter~0 50)} #80#return; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,275 INFO L272 TraceCheckUtils]: 85: Hoare triple {30011#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,275 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {29584#true} {30011#(< ~counter~0 50)} #78#return; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,276 INFO L272 TraceCheckUtils]: 80: Hoare triple {30011#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,276 INFO L290 TraceCheckUtils]: 79: Hoare triple {30011#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,277 INFO L290 TraceCheckUtils]: 78: Hoare triple {30066#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30011#(< ~counter~0 50)} is VALID [2022-04-28 13:34:55,277 INFO L290 TraceCheckUtils]: 77: Hoare triple {30066#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,278 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29584#true} {30066#(< ~counter~0 49)} #82#return; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,278 INFO L272 TraceCheckUtils]: 72: Hoare triple {30066#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,278 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29584#true} {30066#(< ~counter~0 49)} #80#return; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L290 TraceCheckUtils]: 69: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L290 TraceCheckUtils]: 68: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L272 TraceCheckUtils]: 67: Hoare triple {30066#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29584#true} {30066#(< ~counter~0 49)} #78#return; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L290 TraceCheckUtils]: 64: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L290 TraceCheckUtils]: 63: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,279 INFO L272 TraceCheckUtils]: 62: Hoare triple {30066#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {30066#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,280 INFO L290 TraceCheckUtils]: 60: Hoare triple {30121#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30066#(< ~counter~0 49)} is VALID [2022-04-28 13:34:55,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {30121#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,281 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29584#true} {30121#(< ~counter~0 48)} #82#return; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,281 INFO L272 TraceCheckUtils]: 54: Hoare triple {30121#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,282 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {29584#true} {30121#(< ~counter~0 48)} #80#return; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,282 INFO L290 TraceCheckUtils]: 52: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,282 INFO L272 TraceCheckUtils]: 49: Hoare triple {30121#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,282 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {29584#true} {30121#(< ~counter~0 48)} #78#return; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,283 INFO L272 TraceCheckUtils]: 44: Hoare triple {30121#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {30121#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {30176#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30121#(< ~counter~0 48)} is VALID [2022-04-28 13:34:55,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {30176#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,284 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {29584#true} {30176#(< ~counter~0 47)} #82#return; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,285 INFO L272 TraceCheckUtils]: 36: Hoare triple {30176#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,285 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {29584#true} {30176#(< ~counter~0 47)} #80#return; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,285 INFO L272 TraceCheckUtils]: 31: Hoare triple {30176#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,286 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {29584#true} {30176#(< ~counter~0 47)} #78#return; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,286 INFO L272 TraceCheckUtils]: 26: Hoare triple {30176#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {30176#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {30231#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30176#(< ~counter~0 47)} is VALID [2022-04-28 13:34:55,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {30231#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,288 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29584#true} {30231#(< ~counter~0 46)} #82#return; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L272 TraceCheckUtils]: 18: Hoare triple {30231#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29584#true} {30231#(< ~counter~0 46)} #80#return; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L272 TraceCheckUtils]: 13: Hoare triple {30231#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29584#true} {30231#(< ~counter~0 46)} #78#return; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {29584#true} assume true; {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {29584#true} assume !(0 == ~cond); {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {29584#true} ~cond := #in~cond; {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {30231#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29584#true} is VALID [2022-04-28 13:34:55,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {30231#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {30286#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {30231#(< ~counter~0 46)} is VALID [2022-04-28 13:34:55,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {30286#(< ~counter~0 45)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {30286#(< ~counter~0 45)} is VALID [2022-04-28 13:34:55,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {30286#(< ~counter~0 45)} call #t~ret7 := main(); {30286#(< ~counter~0 45)} is VALID [2022-04-28 13:34:55,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30286#(< ~counter~0 45)} {29584#true} #92#return; {30286#(< ~counter~0 45)} is VALID [2022-04-28 13:34:55,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {30286#(< ~counter~0 45)} assume true; {30286#(< ~counter~0 45)} is VALID [2022-04-28 13:34:55,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {29584#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30286#(< ~counter~0 45)} is VALID [2022-04-28 13:34:55,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {29584#true} call ULTIMATE.init(); {29584#true} is VALID [2022-04-28 13:34:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2022-04-28 13:34:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:34:55,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376039170] [2022-04-28 13:34:55,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:34:55,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176988365] [2022-04-28 13:34:55,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176988365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:34:55,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:34:55,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 13:34:55,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:34:55,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414467497] [2022-04-28 13:34:55,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414467497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:34:55,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:34:55,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:34:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504275061] [2022-04-28 13:34:55,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:34:55,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 13:34:55,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:34:55,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:34:55,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:55,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:34:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:55,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:34:55,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:34:55,359 INFO L87 Difference]: Start difference. First operand 311 states and 343 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:34:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:56,236 INFO L93 Difference]: Finished difference Result 364 states and 405 transitions. [2022-04-28 13:34:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 13:34:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 118 [2022-04-28 13:34:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:34:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:34:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 13:34:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:34:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-04-28 13:34:56,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-04-28 13:34:56,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:56,351 INFO L225 Difference]: With dead ends: 364 [2022-04-28 13:34:56,351 INFO L226 Difference]: Without dead ends: 309 [2022-04-28 13:34:56,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:34:56,352 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:34:56,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 164 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:34:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-28 13:34:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-04-28 13:34:56,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:34:56,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:56,795 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:56,795 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:56,799 INFO L93 Difference]: Finished difference Result 309 states and 340 transitions. [2022-04-28 13:34:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 340 transitions. [2022-04-28 13:34:56,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:56,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:56,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 309 states. [2022-04-28 13:34:56,800 INFO L87 Difference]: Start difference. First operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) Second operand 309 states. [2022-04-28 13:34:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:34:56,804 INFO L93 Difference]: Finished difference Result 309 states and 340 transitions. [2022-04-28 13:34:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 340 transitions. [2022-04-28 13:34:56,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:34:56,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:34:56,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:34:56,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:34:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 212 states have (on average 1.1037735849056605) internal successors, (234), 216 states have internal predecessors, (234), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 13:34:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 340 transitions. [2022-04-28 13:34:56,810 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 340 transitions. Word has length 118 [2022-04-28 13:34:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:34:56,810 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 340 transitions. [2022-04-28 13:34:56,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 13:34:56,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 340 transitions. [2022-04-28 13:34:57,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:34:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 340 transitions. [2022-04-28 13:34:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 13:34:57,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:34:57,527 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:34:57,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 13:34:57,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 13:34:57,727 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:34:57,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:34:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 9 times [2022-04-28 13:34:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:34:57,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219557710] [2022-04-28 13:35:00,104 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:00,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1632097758, now seen corresponding path program 10 times [2022-04-28 13:35:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:00,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034836018] [2022-04-28 13:35:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:00,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:00,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597194704] [2022-04-28 13:35:00,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:35:00,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:00,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:00,115 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:00,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 13:35:00,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:35:00,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:00,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 13:35:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:00,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:00,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {32281#true} call ULTIMATE.init(); {32281#true} is VALID [2022-04-28 13:35:00,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {32281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32289#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:00,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {32289#(<= ~counter~0 0)} assume true; {32289#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:00,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32289#(<= ~counter~0 0)} {32281#true} #92#return; {32289#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:00,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {32289#(<= ~counter~0 0)} call #t~ret7 := main(); {32289#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:00,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {32289#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {32289#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:00,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {32289#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {32305#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {32305#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {32305#(<= ~counter~0 1)} ~cond := #in~cond; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {32305#(<= ~counter~0 1)} assume !(0 == ~cond); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {32305#(<= ~counter~0 1)} assume true; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32305#(<= ~counter~0 1)} {32305#(<= ~counter~0 1)} #78#return; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,630 INFO L272 TraceCheckUtils]: 13: Hoare triple {32305#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {32305#(<= ~counter~0 1)} ~cond := #in~cond; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {32305#(<= ~counter~0 1)} assume !(0 == ~cond); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {32305#(<= ~counter~0 1)} assume true; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,631 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32305#(<= ~counter~0 1)} {32305#(<= ~counter~0 1)} #80#return; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,631 INFO L272 TraceCheckUtils]: 18: Hoare triple {32305#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {32305#(<= ~counter~0 1)} ~cond := #in~cond; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {32305#(<= ~counter~0 1)} assume !(0 == ~cond); {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {32305#(<= ~counter~0 1)} assume true; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32305#(<= ~counter~0 1)} {32305#(<= ~counter~0 1)} #82#return; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {32305#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32305#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:00,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {32305#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {32360#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,633 INFO L272 TraceCheckUtils]: 26: Hoare triple {32360#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {32360#(<= ~counter~0 2)} ~cond := #in~cond; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {32360#(<= ~counter~0 2)} assume !(0 == ~cond); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {32360#(<= ~counter~0 2)} assume true; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,634 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32360#(<= ~counter~0 2)} {32360#(<= ~counter~0 2)} #78#return; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,634 INFO L272 TraceCheckUtils]: 31: Hoare triple {32360#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {32360#(<= ~counter~0 2)} ~cond := #in~cond; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {32360#(<= ~counter~0 2)} assume !(0 == ~cond); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {32360#(<= ~counter~0 2)} assume true; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,635 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32360#(<= ~counter~0 2)} {32360#(<= ~counter~0 2)} #80#return; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,635 INFO L272 TraceCheckUtils]: 36: Hoare triple {32360#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {32360#(<= ~counter~0 2)} ~cond := #in~cond; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {32360#(<= ~counter~0 2)} assume !(0 == ~cond); {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {32360#(<= ~counter~0 2)} assume true; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,636 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32360#(<= ~counter~0 2)} {32360#(<= ~counter~0 2)} #82#return; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {32360#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32360#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:00,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {32360#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {32415#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,637 INFO L272 TraceCheckUtils]: 44: Hoare triple {32415#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {32415#(<= ~counter~0 3)} ~cond := #in~cond; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {32415#(<= ~counter~0 3)} assume !(0 == ~cond); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {32415#(<= ~counter~0 3)} assume true; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,638 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32415#(<= ~counter~0 3)} {32415#(<= ~counter~0 3)} #78#return; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,638 INFO L272 TraceCheckUtils]: 49: Hoare triple {32415#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {32415#(<= ~counter~0 3)} ~cond := #in~cond; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {32415#(<= ~counter~0 3)} assume !(0 == ~cond); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {32415#(<= ~counter~0 3)} assume true; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,639 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32415#(<= ~counter~0 3)} {32415#(<= ~counter~0 3)} #80#return; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,639 INFO L272 TraceCheckUtils]: 54: Hoare triple {32415#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {32415#(<= ~counter~0 3)} ~cond := #in~cond; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {32415#(<= ~counter~0 3)} assume !(0 == ~cond); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {32415#(<= ~counter~0 3)} assume true; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,640 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32415#(<= ~counter~0 3)} {32415#(<= ~counter~0 3)} #82#return; {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {32415#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {32415#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:00,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {32415#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {32470#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,641 INFO L272 TraceCheckUtils]: 62: Hoare triple {32470#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {32470#(<= ~counter~0 4)} ~cond := #in~cond; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {32470#(<= ~counter~0 4)} assume !(0 == ~cond); {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {32470#(<= ~counter~0 4)} assume true; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,642 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32470#(<= ~counter~0 4)} {32470#(<= ~counter~0 4)} #84#return; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,642 INFO L272 TraceCheckUtils]: 67: Hoare triple {32470#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {32470#(<= ~counter~0 4)} ~cond := #in~cond; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {32470#(<= ~counter~0 4)} assume !(0 == ~cond); {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {32470#(<= ~counter~0 4)} assume true; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,643 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32470#(<= ~counter~0 4)} {32470#(<= ~counter~0 4)} #86#return; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {32470#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {32470#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32470#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:00,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {32470#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {32513#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,645 INFO L272 TraceCheckUtils]: 76: Hoare triple {32513#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {32513#(<= ~counter~0 5)} ~cond := #in~cond; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {32513#(<= ~counter~0 5)} assume !(0 == ~cond); {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {32513#(<= ~counter~0 5)} assume true; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,645 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32513#(<= ~counter~0 5)} {32513#(<= ~counter~0 5)} #84#return; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,646 INFO L272 TraceCheckUtils]: 81: Hoare triple {32513#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,646 INFO L290 TraceCheckUtils]: 82: Hoare triple {32513#(<= ~counter~0 5)} ~cond := #in~cond; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {32513#(<= ~counter~0 5)} assume !(0 == ~cond); {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {32513#(<= ~counter~0 5)} assume true; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,647 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32513#(<= ~counter~0 5)} {32513#(<= ~counter~0 5)} #86#return; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,647 INFO L290 TraceCheckUtils]: 86: Hoare triple {32513#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,647 INFO L290 TraceCheckUtils]: 87: Hoare triple {32513#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32513#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:00,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {32513#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,648 INFO L290 TraceCheckUtils]: 89: Hoare triple {32556#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,648 INFO L272 TraceCheckUtils]: 90: Hoare triple {32556#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,648 INFO L290 TraceCheckUtils]: 91: Hoare triple {32556#(<= ~counter~0 6)} ~cond := #in~cond; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,648 INFO L290 TraceCheckUtils]: 92: Hoare triple {32556#(<= ~counter~0 6)} assume !(0 == ~cond); {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,648 INFO L290 TraceCheckUtils]: 93: Hoare triple {32556#(<= ~counter~0 6)} assume true; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,649 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32556#(<= ~counter~0 6)} {32556#(<= ~counter~0 6)} #84#return; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,649 INFO L272 TraceCheckUtils]: 95: Hoare triple {32556#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,649 INFO L290 TraceCheckUtils]: 96: Hoare triple {32556#(<= ~counter~0 6)} ~cond := #in~cond; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,649 INFO L290 TraceCheckUtils]: 97: Hoare triple {32556#(<= ~counter~0 6)} assume !(0 == ~cond); {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,650 INFO L290 TraceCheckUtils]: 98: Hoare triple {32556#(<= ~counter~0 6)} assume true; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,650 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32556#(<= ~counter~0 6)} {32556#(<= ~counter~0 6)} #86#return; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,650 INFO L290 TraceCheckUtils]: 100: Hoare triple {32556#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {32556#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32556#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:00,651 INFO L290 TraceCheckUtils]: 102: Hoare triple {32556#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,651 INFO L290 TraceCheckUtils]: 103: Hoare triple {32599#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,651 INFO L272 TraceCheckUtils]: 104: Hoare triple {32599#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {32599#(<= ~counter~0 7)} ~cond := #in~cond; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,652 INFO L290 TraceCheckUtils]: 106: Hoare triple {32599#(<= ~counter~0 7)} assume !(0 == ~cond); {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,652 INFO L290 TraceCheckUtils]: 107: Hoare triple {32599#(<= ~counter~0 7)} assume true; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,652 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32599#(<= ~counter~0 7)} {32599#(<= ~counter~0 7)} #84#return; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,653 INFO L272 TraceCheckUtils]: 109: Hoare triple {32599#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,653 INFO L290 TraceCheckUtils]: 110: Hoare triple {32599#(<= ~counter~0 7)} ~cond := #in~cond; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,653 INFO L290 TraceCheckUtils]: 111: Hoare triple {32599#(<= ~counter~0 7)} assume !(0 == ~cond); {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,653 INFO L290 TraceCheckUtils]: 112: Hoare triple {32599#(<= ~counter~0 7)} assume true; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,653 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32599#(<= ~counter~0 7)} {32599#(<= ~counter~0 7)} #86#return; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 114: Hoare triple {32599#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 115: Hoare triple {32599#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32599#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 116: Hoare triple {32599#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32642#(<= |main_#t~post6| 7)} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 117: Hoare triple {32642#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {32282#false} is VALID [2022-04-28 13:35:00,654 INFO L272 TraceCheckUtils]: 118: Hoare triple {32282#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32282#false} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 119: Hoare triple {32282#false} ~cond := #in~cond; {32282#false} is VALID [2022-04-28 13:35:00,654 INFO L290 TraceCheckUtils]: 120: Hoare triple {32282#false} assume 0 == ~cond; {32282#false} is VALID [2022-04-28 13:35:00,655 INFO L290 TraceCheckUtils]: 121: Hoare triple {32282#false} assume !false; {32282#false} is VALID [2022-04-28 13:35:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 554 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 13:35:00,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:01,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {32282#false} assume !false; {32282#false} is VALID [2022-04-28 13:35:01,043 INFO L290 TraceCheckUtils]: 120: Hoare triple {32282#false} assume 0 == ~cond; {32282#false} is VALID [2022-04-28 13:35:01,043 INFO L290 TraceCheckUtils]: 119: Hoare triple {32282#false} ~cond := #in~cond; {32282#false} is VALID [2022-04-28 13:35:01,043 INFO L272 TraceCheckUtils]: 118: Hoare triple {32282#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32282#false} is VALID [2022-04-28 13:35:01,045 INFO L290 TraceCheckUtils]: 117: Hoare triple {32670#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {32282#false} is VALID [2022-04-28 13:35:01,045 INFO L290 TraceCheckUtils]: 116: Hoare triple {32674#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32670#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:35:01,045 INFO L290 TraceCheckUtils]: 115: Hoare triple {32674#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,045 INFO L290 TraceCheckUtils]: 114: Hoare triple {32674#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,046 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {32281#true} {32674#(< ~counter~0 50)} #86#return; {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,046 INFO L290 TraceCheckUtils]: 112: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,046 INFO L290 TraceCheckUtils]: 111: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,046 INFO L290 TraceCheckUtils]: 110: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,046 INFO L272 TraceCheckUtils]: 109: Hoare triple {32674#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,046 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32281#true} {32674#(< ~counter~0 50)} #84#return; {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,047 INFO L290 TraceCheckUtils]: 105: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,047 INFO L272 TraceCheckUtils]: 104: Hoare triple {32674#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,047 INFO L290 TraceCheckUtils]: 103: Hoare triple {32674#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,048 INFO L290 TraceCheckUtils]: 102: Hoare triple {32717#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32674#(< ~counter~0 50)} is VALID [2022-04-28 13:35:01,048 INFO L290 TraceCheckUtils]: 101: Hoare triple {32717#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,048 INFO L290 TraceCheckUtils]: 100: Hoare triple {32717#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,049 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {32281#true} {32717#(< ~counter~0 49)} #86#return; {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 98: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 97: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 96: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L272 TraceCheckUtils]: 95: Hoare triple {32717#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {32281#true} {32717#(< ~counter~0 49)} #84#return; {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 93: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 92: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,050 INFO L272 TraceCheckUtils]: 90: Hoare triple {32717#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,050 INFO L290 TraceCheckUtils]: 89: Hoare triple {32717#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,050 INFO L290 TraceCheckUtils]: 88: Hoare triple {32760#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32717#(< ~counter~0 49)} is VALID [2022-04-28 13:35:01,050 INFO L290 TraceCheckUtils]: 87: Hoare triple {32760#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {32760#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,051 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {32281#true} {32760#(< ~counter~0 48)} #86#return; {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,051 INFO L272 TraceCheckUtils]: 81: Hoare triple {32760#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,051 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {32281#true} {32760#(< ~counter~0 48)} #84#return; {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,052 INFO L290 TraceCheckUtils]: 78: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,052 INFO L272 TraceCheckUtils]: 76: Hoare triple {32760#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {32760#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {32803#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32760#(< ~counter~0 48)} is VALID [2022-04-28 13:35:01,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {32803#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,053 INFO L290 TraceCheckUtils]: 72: Hoare triple {32803#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,053 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32281#true} {32803#(< ~counter~0 47)} #86#return; {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,053 INFO L290 TraceCheckUtils]: 68: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,053 INFO L272 TraceCheckUtils]: 67: Hoare triple {32803#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,054 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {32281#true} {32803#(< ~counter~0 47)} #84#return; {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,054 INFO L272 TraceCheckUtils]: 62: Hoare triple {32803#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {32803#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {32846#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32803#(< ~counter~0 47)} is VALID [2022-04-28 13:35:01,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {32846#(< ~counter~0 46)} assume !(~r~0 >= ~d~0); {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,055 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {32281#true} {32846#(< ~counter~0 46)} #82#return; {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,055 INFO L272 TraceCheckUtils]: 54: Hoare triple {32846#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {32281#true} {32846#(< ~counter~0 46)} #80#return; {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L272 TraceCheckUtils]: 49: Hoare triple {32846#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {32281#true} {32846#(< ~counter~0 46)} #78#return; {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,057 INFO L272 TraceCheckUtils]: 44: Hoare triple {32846#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {32846#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {32901#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32846#(< ~counter~0 46)} is VALID [2022-04-28 13:35:01,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {32901#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,058 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {32281#true} {32901#(< ~counter~0 45)} #82#return; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,058 INFO L272 TraceCheckUtils]: 36: Hoare triple {32901#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,058 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {32281#true} {32901#(< ~counter~0 45)} #80#return; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,081 INFO L272 TraceCheckUtils]: 31: Hoare triple {32901#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,081 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {32281#true} {32901#(< ~counter~0 45)} #78#return; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,082 INFO L272 TraceCheckUtils]: 26: Hoare triple {32901#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {32901#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {32956#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32901#(< ~counter~0 45)} is VALID [2022-04-28 13:35:01,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {32956#(< ~counter~0 44)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,083 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {32281#true} {32956#(< ~counter~0 44)} #82#return; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L272 TraceCheckUtils]: 18: Hoare triple {32956#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32281#true} {32956#(< ~counter~0 44)} #80#return; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,084 INFO L272 TraceCheckUtils]: 13: Hoare triple {32956#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,085 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {32281#true} {32956#(< ~counter~0 44)} #78#return; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {32281#true} assume true; {32281#true} is VALID [2022-04-28 13:35:01,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {32281#true} assume !(0 == ~cond); {32281#true} is VALID [2022-04-28 13:35:01,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {32281#true} ~cond := #in~cond; {32281#true} is VALID [2022-04-28 13:35:01,085 INFO L272 TraceCheckUtils]: 8: Hoare triple {32956#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {32281#true} is VALID [2022-04-28 13:35:01,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {32956#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {33011#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {32956#(< ~counter~0 44)} is VALID [2022-04-28 13:35:01,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {33011#(< ~counter~0 43)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {33011#(< ~counter~0 43)} is VALID [2022-04-28 13:35:01,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {33011#(< ~counter~0 43)} call #t~ret7 := main(); {33011#(< ~counter~0 43)} is VALID [2022-04-28 13:35:01,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33011#(< ~counter~0 43)} {32281#true} #92#return; {33011#(< ~counter~0 43)} is VALID [2022-04-28 13:35:01,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {33011#(< ~counter~0 43)} assume true; {33011#(< ~counter~0 43)} is VALID [2022-04-28 13:35:01,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {32281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33011#(< ~counter~0 43)} is VALID [2022-04-28 13:35:01,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {32281#true} call ULTIMATE.init(); {32281#true} is VALID [2022-04-28 13:35:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 34 proven. 62 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 13:35:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:01,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034836018] [2022-04-28 13:35:01,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:01,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597194704] [2022-04-28 13:35:01,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597194704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:01,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:01,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 13:35:01,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219557710] [2022-04-28 13:35:01,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219557710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:01,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:01,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:35:01,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809863777] [2022-04-28 13:35:01,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 13:35:01,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:01,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:35:01,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:35:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:35:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 13:35:01,193 INFO L87 Difference]: Start difference. First operand 309 states and 340 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:35:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:02,130 INFO L93 Difference]: Finished difference Result 401 states and 451 transitions. [2022-04-28 13:35:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 13:35:02,130 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 122 [2022-04-28 13:35:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:35:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 13:35:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:35:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 171 transitions. [2022-04-28 13:35:02,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 171 transitions. [2022-04-28 13:35:02,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:02,310 INFO L225 Difference]: With dead ends: 401 [2022-04-28 13:35:02,310 INFO L226 Difference]: Without dead ends: 388 [2022-04-28 13:35:02,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:35:02,312 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 60 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:02,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 227 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:35:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-28 13:35:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2022-04-28 13:35:02,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:02,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:02,685 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:02,685 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:02,691 INFO L93 Difference]: Finished difference Result 388 states and 431 transitions. [2022-04-28 13:35:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 431 transitions. [2022-04-28 13:35:02,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:02,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:02,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 388 states. [2022-04-28 13:35:02,693 INFO L87 Difference]: Start difference. First operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 388 states. [2022-04-28 13:35:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:02,699 INFO L93 Difference]: Finished difference Result 388 states and 431 transitions. [2022-04-28 13:35:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 431 transitions. [2022-04-28 13:35:02,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:02,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:02,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:02,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 266 states have (on average 1.105263157894737) internal successors, (294), 271 states have internal predecessors, (294), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 430 transitions. [2022-04-28 13:35:02,708 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 430 transitions. Word has length 122 [2022-04-28 13:35:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:02,708 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 430 transitions. [2022-04-28 13:35:02,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (20), 10 states have call predecessors, (20), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-28 13:35:02,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 387 states and 430 transitions. [2022-04-28 13:35:03,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 430 transitions. [2022-04-28 13:35:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 13:35:03,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:03,643 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:03,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 13:35:03,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:03,861 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 3 times [2022-04-28 13:35:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:03,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347958184] [2022-04-28 13:35:07,943 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:07,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -867526735, now seen corresponding path program 4 times [2022-04-28 13:35:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:07,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44916006] [2022-04-28 13:35:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:07,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:07,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631022756] [2022-04-28 13:35:07,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:35:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:07,958 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:07,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 13:35:08,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:35:08,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:08,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:35:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:08,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:08,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {35392#true} call ULTIMATE.init(); {35392#true} is VALID [2022-04-28 13:35:08,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {35392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35400#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:08,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {35400#(<= ~counter~0 0)} assume true; {35400#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:08,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35400#(<= ~counter~0 0)} {35392#true} #92#return; {35400#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:08,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {35400#(<= ~counter~0 0)} call #t~ret7 := main(); {35400#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:08,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {35400#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {35400#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:08,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {35400#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {35416#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,679 INFO L272 TraceCheckUtils]: 8: Hoare triple {35416#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {35416#(<= ~counter~0 1)} ~cond := #in~cond; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {35416#(<= ~counter~0 1)} assume !(0 == ~cond); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {35416#(<= ~counter~0 1)} assume true; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,680 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35416#(<= ~counter~0 1)} {35416#(<= ~counter~0 1)} #78#return; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,681 INFO L272 TraceCheckUtils]: 13: Hoare triple {35416#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {35416#(<= ~counter~0 1)} ~cond := #in~cond; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {35416#(<= ~counter~0 1)} assume !(0 == ~cond); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {35416#(<= ~counter~0 1)} assume true; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,682 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35416#(<= ~counter~0 1)} {35416#(<= ~counter~0 1)} #80#return; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,682 INFO L272 TraceCheckUtils]: 18: Hoare triple {35416#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {35416#(<= ~counter~0 1)} ~cond := #in~cond; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {35416#(<= ~counter~0 1)} assume !(0 == ~cond); {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {35416#(<= ~counter~0 1)} assume true; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,683 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35416#(<= ~counter~0 1)} {35416#(<= ~counter~0 1)} #82#return; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {35416#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35416#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:08,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {35416#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {35471#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,685 INFO L272 TraceCheckUtils]: 26: Hoare triple {35471#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {35471#(<= ~counter~0 2)} ~cond := #in~cond; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {35471#(<= ~counter~0 2)} assume !(0 == ~cond); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {35471#(<= ~counter~0 2)} assume true; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,686 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35471#(<= ~counter~0 2)} {35471#(<= ~counter~0 2)} #78#return; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,686 INFO L272 TraceCheckUtils]: 31: Hoare triple {35471#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {35471#(<= ~counter~0 2)} ~cond := #in~cond; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {35471#(<= ~counter~0 2)} assume !(0 == ~cond); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {35471#(<= ~counter~0 2)} assume true; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,687 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35471#(<= ~counter~0 2)} {35471#(<= ~counter~0 2)} #80#return; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,688 INFO L272 TraceCheckUtils]: 36: Hoare triple {35471#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {35471#(<= ~counter~0 2)} ~cond := #in~cond; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {35471#(<= ~counter~0 2)} assume !(0 == ~cond); {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {35471#(<= ~counter~0 2)} assume true; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,689 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35471#(<= ~counter~0 2)} {35471#(<= ~counter~0 2)} #82#return; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {35471#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35471#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:08,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {35471#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {35526#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,690 INFO L272 TraceCheckUtils]: 44: Hoare triple {35526#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {35526#(<= ~counter~0 3)} ~cond := #in~cond; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {35526#(<= ~counter~0 3)} assume !(0 == ~cond); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {35526#(<= ~counter~0 3)} assume true; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,691 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35526#(<= ~counter~0 3)} {35526#(<= ~counter~0 3)} #78#return; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,692 INFO L272 TraceCheckUtils]: 49: Hoare triple {35526#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {35526#(<= ~counter~0 3)} ~cond := #in~cond; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,715 INFO L290 TraceCheckUtils]: 51: Hoare triple {35526#(<= ~counter~0 3)} assume !(0 == ~cond); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {35526#(<= ~counter~0 3)} assume true; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,715 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35526#(<= ~counter~0 3)} {35526#(<= ~counter~0 3)} #80#return; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,716 INFO L272 TraceCheckUtils]: 54: Hoare triple {35526#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,716 INFO L290 TraceCheckUtils]: 55: Hoare triple {35526#(<= ~counter~0 3)} ~cond := #in~cond; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {35526#(<= ~counter~0 3)} assume !(0 == ~cond); {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {35526#(<= ~counter~0 3)} assume true; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,717 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35526#(<= ~counter~0 3)} {35526#(<= ~counter~0 3)} #82#return; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,717 INFO L290 TraceCheckUtils]: 59: Hoare triple {35526#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35526#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:08,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {35526#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {35581#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,719 INFO L272 TraceCheckUtils]: 62: Hoare triple {35581#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {35581#(<= ~counter~0 4)} ~cond := #in~cond; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {35581#(<= ~counter~0 4)} assume !(0 == ~cond); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {35581#(<= ~counter~0 4)} assume true; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,720 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35581#(<= ~counter~0 4)} {35581#(<= ~counter~0 4)} #78#return; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,721 INFO L272 TraceCheckUtils]: 67: Hoare triple {35581#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {35581#(<= ~counter~0 4)} ~cond := #in~cond; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {35581#(<= ~counter~0 4)} assume !(0 == ~cond); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {35581#(<= ~counter~0 4)} assume true; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,722 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35581#(<= ~counter~0 4)} {35581#(<= ~counter~0 4)} #80#return; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,722 INFO L272 TraceCheckUtils]: 72: Hoare triple {35581#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {35581#(<= ~counter~0 4)} ~cond := #in~cond; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {35581#(<= ~counter~0 4)} assume !(0 == ~cond); {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {35581#(<= ~counter~0 4)} assume true; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,723 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35581#(<= ~counter~0 4)} {35581#(<= ~counter~0 4)} #82#return; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {35581#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35581#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:08,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {35581#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {35636#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,724 INFO L272 TraceCheckUtils]: 80: Hoare triple {35636#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,725 INFO L290 TraceCheckUtils]: 81: Hoare triple {35636#(<= ~counter~0 5)} ~cond := #in~cond; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {35636#(<= ~counter~0 5)} assume !(0 == ~cond); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {35636#(<= ~counter~0 5)} assume true; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,726 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35636#(<= ~counter~0 5)} {35636#(<= ~counter~0 5)} #78#return; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,726 INFO L272 TraceCheckUtils]: 85: Hoare triple {35636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {35636#(<= ~counter~0 5)} ~cond := #in~cond; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {35636#(<= ~counter~0 5)} assume !(0 == ~cond); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {35636#(<= ~counter~0 5)} assume true; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,727 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35636#(<= ~counter~0 5)} {35636#(<= ~counter~0 5)} #80#return; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,728 INFO L272 TraceCheckUtils]: 90: Hoare triple {35636#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,728 INFO L290 TraceCheckUtils]: 91: Hoare triple {35636#(<= ~counter~0 5)} ~cond := #in~cond; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,728 INFO L290 TraceCheckUtils]: 92: Hoare triple {35636#(<= ~counter~0 5)} assume !(0 == ~cond); {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {35636#(<= ~counter~0 5)} assume true; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,729 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35636#(<= ~counter~0 5)} {35636#(<= ~counter~0 5)} #82#return; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,729 INFO L290 TraceCheckUtils]: 95: Hoare triple {35636#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35636#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:08,730 INFO L290 TraceCheckUtils]: 96: Hoare triple {35636#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,730 INFO L290 TraceCheckUtils]: 97: Hoare triple {35691#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,730 INFO L272 TraceCheckUtils]: 98: Hoare triple {35691#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,730 INFO L290 TraceCheckUtils]: 99: Hoare triple {35691#(<= ~counter~0 6)} ~cond := #in~cond; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,731 INFO L290 TraceCheckUtils]: 100: Hoare triple {35691#(<= ~counter~0 6)} assume !(0 == ~cond); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,731 INFO L290 TraceCheckUtils]: 101: Hoare triple {35691#(<= ~counter~0 6)} assume true; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,731 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35691#(<= ~counter~0 6)} {35691#(<= ~counter~0 6)} #78#return; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,731 INFO L272 TraceCheckUtils]: 103: Hoare triple {35691#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,732 INFO L290 TraceCheckUtils]: 104: Hoare triple {35691#(<= ~counter~0 6)} ~cond := #in~cond; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,732 INFO L290 TraceCheckUtils]: 105: Hoare triple {35691#(<= ~counter~0 6)} assume !(0 == ~cond); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,733 INFO L290 TraceCheckUtils]: 106: Hoare triple {35691#(<= ~counter~0 6)} assume true; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,733 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35691#(<= ~counter~0 6)} {35691#(<= ~counter~0 6)} #80#return; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,733 INFO L272 TraceCheckUtils]: 108: Hoare triple {35691#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,734 INFO L290 TraceCheckUtils]: 109: Hoare triple {35691#(<= ~counter~0 6)} ~cond := #in~cond; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,734 INFO L290 TraceCheckUtils]: 110: Hoare triple {35691#(<= ~counter~0 6)} assume !(0 == ~cond); {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,734 INFO L290 TraceCheckUtils]: 111: Hoare triple {35691#(<= ~counter~0 6)} assume true; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,735 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35691#(<= ~counter~0 6)} {35691#(<= ~counter~0 6)} #82#return; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,735 INFO L290 TraceCheckUtils]: 113: Hoare triple {35691#(<= ~counter~0 6)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35691#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:08,735 INFO L290 TraceCheckUtils]: 114: Hoare triple {35691#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35746#(<= |main_#t~post5| 6)} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 115: Hoare triple {35746#(<= |main_#t~post5| 6)} assume !(#t~post5 < 50);havoc #t~post5; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 116: Hoare triple {35393#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 117: Hoare triple {35393#false} assume !!(#t~post6 < 50);havoc #t~post6; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L272 TraceCheckUtils]: 118: Hoare triple {35393#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 119: Hoare triple {35393#false} ~cond := #in~cond; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 120: Hoare triple {35393#false} assume !(0 == ~cond); {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 121: Hoare triple {35393#false} assume true; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35393#false} {35393#false} #84#return; {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L272 TraceCheckUtils]: 123: Hoare triple {35393#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35393#false} is VALID [2022-04-28 13:35:08,736 INFO L290 TraceCheckUtils]: 124: Hoare triple {35393#false} ~cond := #in~cond; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {35393#false} assume !(0 == ~cond); {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 126: Hoare triple {35393#false} assume true; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35393#false} {35393#false} #86#return; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {35393#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {35393#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 130: Hoare triple {35393#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 131: Hoare triple {35393#false} assume !(#t~post6 < 50);havoc #t~post6; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L272 TraceCheckUtils]: 132: Hoare triple {35393#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 133: Hoare triple {35393#false} ~cond := #in~cond; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 134: Hoare triple {35393#false} assume 0 == ~cond; {35393#false} is VALID [2022-04-28 13:35:08,737 INFO L290 TraceCheckUtils]: 135: Hoare triple {35393#false} assume !false; {35393#false} is VALID [2022-04-28 13:35:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 180 proven. 642 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-04-28 13:35:08,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 135: Hoare triple {35393#false} assume !false; {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 134: Hoare triple {35393#false} assume 0 == ~cond; {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 133: Hoare triple {35393#false} ~cond := #in~cond; {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L272 TraceCheckUtils]: 132: Hoare triple {35393#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 131: Hoare triple {35393#false} assume !(#t~post6 < 50);havoc #t~post6; {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 130: Hoare triple {35393#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35393#false} is VALID [2022-04-28 13:35:09,361 INFO L290 TraceCheckUtils]: 129: Hoare triple {35393#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {35393#false} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 128: Hoare triple {35393#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {35393#false} is VALID [2022-04-28 13:35:09,362 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35392#true} {35393#false} #86#return; {35393#false} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 126: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 125: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 124: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L272 TraceCheckUtils]: 123: Hoare triple {35393#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35392#true} {35393#false} #84#return; {35393#false} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 121: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 119: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L272 TraceCheckUtils]: 118: Hoare triple {35393#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 117: Hoare triple {35393#false} assume !!(#t~post6 < 50);havoc #t~post6; {35393#false} is VALID [2022-04-28 13:35:09,362 INFO L290 TraceCheckUtils]: 116: Hoare triple {35393#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35393#false} is VALID [2022-04-28 13:35:09,363 INFO L290 TraceCheckUtils]: 115: Hoare triple {35870#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {35393#false} is VALID [2022-04-28 13:35:09,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {35874#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35870#(< |main_#t~post5| 50)} is VALID [2022-04-28 13:35:09,363 INFO L290 TraceCheckUtils]: 113: Hoare triple {35874#(< ~counter~0 50)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,364 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35392#true} {35874#(< ~counter~0 50)} #82#return; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,364 INFO L290 TraceCheckUtils]: 111: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,364 INFO L290 TraceCheckUtils]: 110: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,364 INFO L290 TraceCheckUtils]: 109: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,364 INFO L272 TraceCheckUtils]: 108: Hoare triple {35874#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,364 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {35392#true} {35874#(< ~counter~0 50)} #80#return; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 106: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 104: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L272 TraceCheckUtils]: 103: Hoare triple {35874#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {35392#true} {35874#(< ~counter~0 50)} #78#return; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 101: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 100: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L290 TraceCheckUtils]: 99: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,365 INFO L272 TraceCheckUtils]: 98: Hoare triple {35874#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,366 INFO L290 TraceCheckUtils]: 97: Hoare triple {35874#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,367 INFO L290 TraceCheckUtils]: 96: Hoare triple {35929#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35874#(< ~counter~0 50)} is VALID [2022-04-28 13:35:09,367 INFO L290 TraceCheckUtils]: 95: Hoare triple {35929#(< ~counter~0 49)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,367 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35392#true} {35929#(< ~counter~0 49)} #82#return; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 91: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L272 TraceCheckUtils]: 90: Hoare triple {35929#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35392#true} {35929#(< ~counter~0 49)} #80#return; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 88: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 87: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L290 TraceCheckUtils]: 86: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,368 INFO L272 TraceCheckUtils]: 85: Hoare triple {35929#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,369 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35392#true} {35929#(< ~counter~0 49)} #78#return; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,369 INFO L290 TraceCheckUtils]: 83: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,369 INFO L290 TraceCheckUtils]: 82: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,369 INFO L272 TraceCheckUtils]: 80: Hoare triple {35929#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,369 INFO L290 TraceCheckUtils]: 79: Hoare triple {35929#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {35984#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35929#(< ~counter~0 49)} is VALID [2022-04-28 13:35:09,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {35984#(< ~counter~0 48)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,371 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {35392#true} {35984#(< ~counter~0 48)} #82#return; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,371 INFO L272 TraceCheckUtils]: 72: Hoare triple {35984#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,371 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35392#true} {35984#(< ~counter~0 48)} #80#return; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 70: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 68: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L272 TraceCheckUtils]: 67: Hoare triple {35984#(< ~counter~0 48)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {35392#true} {35984#(< ~counter~0 48)} #78#return; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,372 INFO L272 TraceCheckUtils]: 62: Hoare triple {35984#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {35984#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {36039#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35984#(< ~counter~0 48)} is VALID [2022-04-28 13:35:09,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {36039#(< ~counter~0 47)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,374 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {35392#true} {36039#(< ~counter~0 47)} #82#return; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,374 INFO L272 TraceCheckUtils]: 54: Hoare triple {36039#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,375 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {35392#true} {36039#(< ~counter~0 47)} #80#return; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,375 INFO L272 TraceCheckUtils]: 49: Hoare triple {36039#(< ~counter~0 47)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,375 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {35392#true} {36039#(< ~counter~0 47)} #78#return; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,376 INFO L272 TraceCheckUtils]: 44: Hoare triple {36039#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {36039#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {36094#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36039#(< ~counter~0 47)} is VALID [2022-04-28 13:35:09,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {36094#(< ~counter~0 46)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,377 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35392#true} {36094#(< ~counter~0 46)} #82#return; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {36094#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {35392#true} {36094#(< ~counter~0 46)} #80#return; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,378 INFO L272 TraceCheckUtils]: 31: Hoare triple {36094#(< ~counter~0 46)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,379 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35392#true} {36094#(< ~counter~0 46)} #78#return; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,379 INFO L272 TraceCheckUtils]: 26: Hoare triple {36094#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {36094#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {36149#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36094#(< ~counter~0 46)} is VALID [2022-04-28 13:35:09,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {36149#(< ~counter~0 45)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,381 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35392#true} {36149#(< ~counter~0 45)} #82#return; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,381 INFO L272 TraceCheckUtils]: 18: Hoare triple {36149#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,381 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35392#true} {36149#(< ~counter~0 45)} #80#return; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {36149#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35392#true} {36149#(< ~counter~0 45)} #78#return; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {35392#true} assume true; {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {35392#true} assume !(0 == ~cond); {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {35392#true} ~cond := #in~cond; {35392#true} is VALID [2022-04-28 13:35:09,382 INFO L272 TraceCheckUtils]: 8: Hoare triple {36149#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35392#true} is VALID [2022-04-28 13:35:09,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {36149#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {36204#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36149#(< ~counter~0 45)} is VALID [2022-04-28 13:35:09,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {36204#(< ~counter~0 44)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {36204#(< ~counter~0 44)} is VALID [2022-04-28 13:35:09,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {36204#(< ~counter~0 44)} call #t~ret7 := main(); {36204#(< ~counter~0 44)} is VALID [2022-04-28 13:35:09,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36204#(< ~counter~0 44)} {35392#true} #92#return; {36204#(< ~counter~0 44)} is VALID [2022-04-28 13:35:09,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {36204#(< ~counter~0 44)} assume true; {36204#(< ~counter~0 44)} is VALID [2022-04-28 13:35:09,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {35392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36204#(< ~counter~0 44)} is VALID [2022-04-28 13:35:09,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {35392#true} call ULTIMATE.init(); {35392#true} is VALID [2022-04-28 13:35:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 40 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2022-04-28 13:35:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44916006] [2022-04-28 13:35:09,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631022756] [2022-04-28 13:35:09,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631022756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:09,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:09,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 13:35:09,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:09,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347958184] [2022-04-28 13:35:09,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347958184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:09,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:09,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:35:09,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955692021] [2022-04-28 13:35:09,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 13:35:09,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:09,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:35:09,461 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-28 13:35:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:35:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:35:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:35:09,462 INFO L87 Difference]: Start difference. First operand 387 states and 430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:35:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:10,682 INFO L93 Difference]: Finished difference Result 440 states and 492 transitions. [2022-04-28 13:35:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 13:35:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 136 [2022-04-28 13:35:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:35:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 13:35:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:35:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2022-04-28 13:35:10,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 158 transitions. [2022-04-28 13:35:10,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:10,826 INFO L225 Difference]: With dead ends: 440 [2022-04-28 13:35:10,826 INFO L226 Difference]: Without dead ends: 385 [2022-04-28 13:35:10,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:35:10,829 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:10,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 221 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:35:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-04-28 13:35:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2022-04-28 13:35:11,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:11,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 385 states. Second operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:11,186 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:11,186 INFO L87 Difference]: Start difference. First operand 385 states. Second operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:11,203 INFO L93 Difference]: Finished difference Result 385 states and 427 transitions. [2022-04-28 13:35:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 427 transitions. [2022-04-28 13:35:11,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:11,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:11,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 385 states. [2022-04-28 13:35:11,204 INFO L87 Difference]: Start difference. First operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) Second operand 385 states. [2022-04-28 13:35:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:11,211 INFO L93 Difference]: Finished difference Result 385 states and 427 transitions. [2022-04-28 13:35:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 427 transitions. [2022-04-28 13:35:11,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:11,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:11,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:11,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 264 states have (on average 1.1022727272727273) internal successors, (291), 269 states have internal predecessors, (291), 69 states have call successors, (69), 52 states have call predecessors, (69), 51 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-28 13:35:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 427 transitions. [2022-04-28 13:35:11,219 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 427 transitions. Word has length 136 [2022-04-28 13:35:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:11,219 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 427 transitions. [2022-04-28 13:35:11,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 9 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 13:35:11,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 385 states and 427 transitions. [2022-04-28 13:35:12,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 427 transitions. [2022-04-28 13:35:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 13:35:12,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:12,132 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:12,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 13:35:12,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 13:35:12,333 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 11 times [2022-04-28 13:35:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1850780078] [2022-04-28 13:35:15,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:15,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1792552182, now seen corresponding path program 12 times [2022-04-28 13:35:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:15,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411255941] [2022-04-28 13:35:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:15,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:15,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479111391] [2022-04-28 13:35:15,674 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:35:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:15,675 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 13:35:15,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 13:35:15,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:15,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 13:35:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:15,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:16,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {38657#true} call ULTIMATE.init(); {38657#true} is VALID [2022-04-28 13:35:16,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {38657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38665#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:16,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {38665#(<= ~counter~0 0)} assume true; {38665#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:16,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38665#(<= ~counter~0 0)} {38657#true} #92#return; {38665#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:16,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {38665#(<= ~counter~0 0)} call #t~ret7 := main(); {38665#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:16,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {38665#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {38665#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:16,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {38665#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {38681#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,460 INFO L272 TraceCheckUtils]: 8: Hoare triple {38681#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {38681#(<= ~counter~0 1)} ~cond := #in~cond; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {38681#(<= ~counter~0 1)} assume !(0 == ~cond); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {38681#(<= ~counter~0 1)} assume true; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,461 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38681#(<= ~counter~0 1)} {38681#(<= ~counter~0 1)} #78#return; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,461 INFO L272 TraceCheckUtils]: 13: Hoare triple {38681#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {38681#(<= ~counter~0 1)} ~cond := #in~cond; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {38681#(<= ~counter~0 1)} assume !(0 == ~cond); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {38681#(<= ~counter~0 1)} assume true; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,463 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38681#(<= ~counter~0 1)} {38681#(<= ~counter~0 1)} #80#return; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,463 INFO L272 TraceCheckUtils]: 18: Hoare triple {38681#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {38681#(<= ~counter~0 1)} ~cond := #in~cond; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {38681#(<= ~counter~0 1)} assume !(0 == ~cond); {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {38681#(<= ~counter~0 1)} assume true; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,464 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38681#(<= ~counter~0 1)} {38681#(<= ~counter~0 1)} #82#return; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {38681#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38681#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:16,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {38681#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {38736#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,466 INFO L272 TraceCheckUtils]: 26: Hoare triple {38736#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {38736#(<= ~counter~0 2)} ~cond := #in~cond; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {38736#(<= ~counter~0 2)} assume !(0 == ~cond); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {38736#(<= ~counter~0 2)} assume true; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,467 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38736#(<= ~counter~0 2)} {38736#(<= ~counter~0 2)} #78#return; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,468 INFO L272 TraceCheckUtils]: 31: Hoare triple {38736#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {38736#(<= ~counter~0 2)} ~cond := #in~cond; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {38736#(<= ~counter~0 2)} assume !(0 == ~cond); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {38736#(<= ~counter~0 2)} assume true; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,469 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38736#(<= ~counter~0 2)} {38736#(<= ~counter~0 2)} #80#return; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,469 INFO L272 TraceCheckUtils]: 36: Hoare triple {38736#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {38736#(<= ~counter~0 2)} ~cond := #in~cond; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {38736#(<= ~counter~0 2)} assume !(0 == ~cond); {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {38736#(<= ~counter~0 2)} assume true; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,470 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38736#(<= ~counter~0 2)} {38736#(<= ~counter~0 2)} #82#return; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {38736#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38736#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:16,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {38736#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {38791#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,472 INFO L272 TraceCheckUtils]: 44: Hoare triple {38791#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {38791#(<= ~counter~0 3)} ~cond := #in~cond; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {38791#(<= ~counter~0 3)} assume !(0 == ~cond); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {38791#(<= ~counter~0 3)} assume true; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,473 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38791#(<= ~counter~0 3)} {38791#(<= ~counter~0 3)} #78#return; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,474 INFO L272 TraceCheckUtils]: 49: Hoare triple {38791#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {38791#(<= ~counter~0 3)} ~cond := #in~cond; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {38791#(<= ~counter~0 3)} assume !(0 == ~cond); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {38791#(<= ~counter~0 3)} assume true; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,475 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38791#(<= ~counter~0 3)} {38791#(<= ~counter~0 3)} #80#return; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,475 INFO L272 TraceCheckUtils]: 54: Hoare triple {38791#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {38791#(<= ~counter~0 3)} ~cond := #in~cond; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {38791#(<= ~counter~0 3)} assume !(0 == ~cond); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {38791#(<= ~counter~0 3)} assume true; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,477 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38791#(<= ~counter~0 3)} {38791#(<= ~counter~0 3)} #82#return; {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {38791#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {38791#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:16,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {38791#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {38846#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,479 INFO L272 TraceCheckUtils]: 62: Hoare triple {38846#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {38846#(<= ~counter~0 4)} ~cond := #in~cond; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {38846#(<= ~counter~0 4)} assume !(0 == ~cond); {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {38846#(<= ~counter~0 4)} assume true; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,480 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38846#(<= ~counter~0 4)} {38846#(<= ~counter~0 4)} #84#return; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,480 INFO L272 TraceCheckUtils]: 67: Hoare triple {38846#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {38846#(<= ~counter~0 4)} ~cond := #in~cond; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {38846#(<= ~counter~0 4)} assume !(0 == ~cond); {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {38846#(<= ~counter~0 4)} assume true; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,482 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38846#(<= ~counter~0 4)} {38846#(<= ~counter~0 4)} #86#return; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {38846#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {38846#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38846#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:16,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {38846#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {38889#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,484 INFO L272 TraceCheckUtils]: 76: Hoare triple {38889#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,484 INFO L290 TraceCheckUtils]: 77: Hoare triple {38889#(<= ~counter~0 5)} ~cond := #in~cond; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,484 INFO L290 TraceCheckUtils]: 78: Hoare triple {38889#(<= ~counter~0 5)} assume !(0 == ~cond); {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {38889#(<= ~counter~0 5)} assume true; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,498 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38889#(<= ~counter~0 5)} {38889#(<= ~counter~0 5)} #84#return; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,498 INFO L272 TraceCheckUtils]: 81: Hoare triple {38889#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {38889#(<= ~counter~0 5)} ~cond := #in~cond; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {38889#(<= ~counter~0 5)} assume !(0 == ~cond); {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {38889#(<= ~counter~0 5)} assume true; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,500 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38889#(<= ~counter~0 5)} {38889#(<= ~counter~0 5)} #86#return; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,500 INFO L290 TraceCheckUtils]: 86: Hoare triple {38889#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {38889#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38889#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:16,501 INFO L290 TraceCheckUtils]: 88: Hoare triple {38889#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {38932#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,502 INFO L272 TraceCheckUtils]: 90: Hoare triple {38932#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {38932#(<= ~counter~0 6)} ~cond := #in~cond; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,503 INFO L290 TraceCheckUtils]: 92: Hoare triple {38932#(<= ~counter~0 6)} assume !(0 == ~cond); {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,503 INFO L290 TraceCheckUtils]: 93: Hoare triple {38932#(<= ~counter~0 6)} assume true; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,503 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38932#(<= ~counter~0 6)} {38932#(<= ~counter~0 6)} #84#return; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,504 INFO L272 TraceCheckUtils]: 95: Hoare triple {38932#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,504 INFO L290 TraceCheckUtils]: 96: Hoare triple {38932#(<= ~counter~0 6)} ~cond := #in~cond; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,504 INFO L290 TraceCheckUtils]: 97: Hoare triple {38932#(<= ~counter~0 6)} assume !(0 == ~cond); {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,505 INFO L290 TraceCheckUtils]: 98: Hoare triple {38932#(<= ~counter~0 6)} assume true; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,505 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38932#(<= ~counter~0 6)} {38932#(<= ~counter~0 6)} #86#return; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {38932#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,506 INFO L290 TraceCheckUtils]: 101: Hoare triple {38932#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38932#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:16,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {38932#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,507 INFO L290 TraceCheckUtils]: 103: Hoare triple {38975#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,507 INFO L272 TraceCheckUtils]: 104: Hoare triple {38975#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,507 INFO L290 TraceCheckUtils]: 105: Hoare triple {38975#(<= ~counter~0 7)} ~cond := #in~cond; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,508 INFO L290 TraceCheckUtils]: 106: Hoare triple {38975#(<= ~counter~0 7)} assume !(0 == ~cond); {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,508 INFO L290 TraceCheckUtils]: 107: Hoare triple {38975#(<= ~counter~0 7)} assume true; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,508 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38975#(<= ~counter~0 7)} {38975#(<= ~counter~0 7)} #84#return; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,509 INFO L272 TraceCheckUtils]: 109: Hoare triple {38975#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,509 INFO L290 TraceCheckUtils]: 110: Hoare triple {38975#(<= ~counter~0 7)} ~cond := #in~cond; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,509 INFO L290 TraceCheckUtils]: 111: Hoare triple {38975#(<= ~counter~0 7)} assume !(0 == ~cond); {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {38975#(<= ~counter~0 7)} assume true; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,510 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38975#(<= ~counter~0 7)} {38975#(<= ~counter~0 7)} #86#return; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,510 INFO L290 TraceCheckUtils]: 114: Hoare triple {38975#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,511 INFO L290 TraceCheckUtils]: 115: Hoare triple {38975#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38975#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:16,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {38975#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {39018#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,512 INFO L272 TraceCheckUtils]: 118: Hoare triple {39018#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,513 INFO L290 TraceCheckUtils]: 119: Hoare triple {39018#(<= ~counter~0 8)} ~cond := #in~cond; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,513 INFO L290 TraceCheckUtils]: 120: Hoare triple {39018#(<= ~counter~0 8)} assume !(0 == ~cond); {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,513 INFO L290 TraceCheckUtils]: 121: Hoare triple {39018#(<= ~counter~0 8)} assume true; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,514 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {39018#(<= ~counter~0 8)} {39018#(<= ~counter~0 8)} #84#return; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,514 INFO L272 TraceCheckUtils]: 123: Hoare triple {39018#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,514 INFO L290 TraceCheckUtils]: 124: Hoare triple {39018#(<= ~counter~0 8)} ~cond := #in~cond; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,515 INFO L290 TraceCheckUtils]: 125: Hoare triple {39018#(<= ~counter~0 8)} assume !(0 == ~cond); {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,515 INFO L290 TraceCheckUtils]: 126: Hoare triple {39018#(<= ~counter~0 8)} assume true; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,515 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {39018#(<= ~counter~0 8)} {39018#(<= ~counter~0 8)} #86#return; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,516 INFO L290 TraceCheckUtils]: 128: Hoare triple {39018#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,516 INFO L290 TraceCheckUtils]: 129: Hoare triple {39018#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39018#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:16,516 INFO L290 TraceCheckUtils]: 130: Hoare triple {39018#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39061#(<= |main_#t~post6| 8)} is VALID [2022-04-28 13:35:16,517 INFO L290 TraceCheckUtils]: 131: Hoare triple {39061#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {38658#false} is VALID [2022-04-28 13:35:16,517 INFO L272 TraceCheckUtils]: 132: Hoare triple {38658#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38658#false} is VALID [2022-04-28 13:35:16,517 INFO L290 TraceCheckUtils]: 133: Hoare triple {38658#false} ~cond := #in~cond; {38658#false} is VALID [2022-04-28 13:35:16,517 INFO L290 TraceCheckUtils]: 134: Hoare triple {38658#false} assume 0 == ~cond; {38658#false} is VALID [2022-04-28 13:35:16,517 INFO L290 TraceCheckUtils]: 135: Hoare triple {38658#false} assume !false; {38658#false} is VALID [2022-04-28 13:35:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 716 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 13:35:16,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:17,105 INFO L290 TraceCheckUtils]: 135: Hoare triple {38658#false} assume !false; {38658#false} is VALID [2022-04-28 13:35:17,105 INFO L290 TraceCheckUtils]: 134: Hoare triple {38658#false} assume 0 == ~cond; {38658#false} is VALID [2022-04-28 13:35:17,106 INFO L290 TraceCheckUtils]: 133: Hoare triple {38658#false} ~cond := #in~cond; {38658#false} is VALID [2022-04-28 13:35:17,106 INFO L272 TraceCheckUtils]: 132: Hoare triple {38658#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {38658#false} is VALID [2022-04-28 13:35:17,106 INFO L290 TraceCheckUtils]: 131: Hoare triple {39089#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {38658#false} is VALID [2022-04-28 13:35:17,106 INFO L290 TraceCheckUtils]: 130: Hoare triple {39093#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39089#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:35:17,106 INFO L290 TraceCheckUtils]: 129: Hoare triple {39093#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,107 INFO L290 TraceCheckUtils]: 128: Hoare triple {39093#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,107 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38657#true} {39093#(< ~counter~0 50)} #86#return; {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,107 INFO L290 TraceCheckUtils]: 126: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,107 INFO L290 TraceCheckUtils]: 125: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,107 INFO L290 TraceCheckUtils]: 124: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,107 INFO L272 TraceCheckUtils]: 123: Hoare triple {39093#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,107 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {38657#true} {39093#(< ~counter~0 50)} #84#return; {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,108 INFO L290 TraceCheckUtils]: 121: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,108 INFO L290 TraceCheckUtils]: 120: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,108 INFO L290 TraceCheckUtils]: 119: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,108 INFO L272 TraceCheckUtils]: 118: Hoare triple {39093#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {39093#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,109 INFO L290 TraceCheckUtils]: 116: Hoare triple {39136#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39093#(< ~counter~0 50)} is VALID [2022-04-28 13:35:17,109 INFO L290 TraceCheckUtils]: 115: Hoare triple {39136#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,109 INFO L290 TraceCheckUtils]: 114: Hoare triple {39136#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,110 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38657#true} {39136#(< ~counter~0 49)} #86#return; {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,110 INFO L290 TraceCheckUtils]: 112: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,110 INFO L290 TraceCheckUtils]: 111: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,110 INFO L272 TraceCheckUtils]: 109: Hoare triple {39136#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,110 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38657#true} {39136#(< ~counter~0 49)} #84#return; {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,110 INFO L290 TraceCheckUtils]: 107: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,111 INFO L272 TraceCheckUtils]: 104: Hoare triple {39136#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {39136#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,111 INFO L290 TraceCheckUtils]: 102: Hoare triple {39179#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39136#(< ~counter~0 49)} is VALID [2022-04-28 13:35:17,112 INFO L290 TraceCheckUtils]: 101: Hoare triple {39179#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,112 INFO L290 TraceCheckUtils]: 100: Hoare triple {39179#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,112 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {38657#true} {39179#(< ~counter~0 48)} #86#return; {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,112 INFO L290 TraceCheckUtils]: 98: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,112 INFO L290 TraceCheckUtils]: 97: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,112 INFO L272 TraceCheckUtils]: 95: Hoare triple {39179#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,113 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {38657#true} {39179#(< ~counter~0 48)} #84#return; {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,113 INFO L290 TraceCheckUtils]: 92: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,113 INFO L290 TraceCheckUtils]: 91: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,113 INFO L272 TraceCheckUtils]: 90: Hoare triple {39179#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {39179#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {39222#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39179#(< ~counter~0 48)} is VALID [2022-04-28 13:35:17,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {39222#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {39222#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,114 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {38657#true} {39222#(< ~counter~0 47)} #86#return; {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L272 TraceCheckUtils]: 81: Hoare triple {39222#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {38657#true} {39222#(< ~counter~0 47)} #84#return; {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,115 INFO L272 TraceCheckUtils]: 76: Hoare triple {39222#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {39222#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {39265#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39222#(< ~counter~0 47)} is VALID [2022-04-28 13:35:17,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {39265#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {39265#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,117 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38657#true} {39265#(< ~counter~0 46)} #86#return; {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,117 INFO L272 TraceCheckUtils]: 67: Hoare triple {39265#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,117 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {38657#true} {39265#(< ~counter~0 46)} #84#return; {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,118 INFO L272 TraceCheckUtils]: 62: Hoare triple {39265#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,118 INFO L290 TraceCheckUtils]: 61: Hoare triple {39265#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,118 INFO L290 TraceCheckUtils]: 60: Hoare triple {39308#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39265#(< ~counter~0 46)} is VALID [2022-04-28 13:35:17,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {39308#(< ~counter~0 45)} assume !(~r~0 >= ~d~0); {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,119 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {38657#true} {39308#(< ~counter~0 45)} #82#return; {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,119 INFO L290 TraceCheckUtils]: 56: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,119 INFO L272 TraceCheckUtils]: 54: Hoare triple {39308#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38657#true} {39308#(< ~counter~0 45)} #80#return; {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L272 TraceCheckUtils]: 49: Hoare triple {39308#(< ~counter~0 45)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {38657#true} {39308#(< ~counter~0 45)} #78#return; {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,120 INFO L272 TraceCheckUtils]: 44: Hoare triple {39308#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {39308#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {39363#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39308#(< ~counter~0 45)} is VALID [2022-04-28 13:35:17,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {39363#(< ~counter~0 44)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,122 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {38657#true} {39363#(< ~counter~0 44)} #82#return; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L272 TraceCheckUtils]: 36: Hoare triple {39363#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38657#true} {39363#(< ~counter~0 44)} #80#return; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L272 TraceCheckUtils]: 31: Hoare triple {39363#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {38657#true} {39363#(< ~counter~0 44)} #78#return; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L272 TraceCheckUtils]: 26: Hoare triple {39363#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {39363#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {39418#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:17,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {39418#(< ~counter~0 43)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,124 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {38657#true} {39418#(< ~counter~0 43)} #82#return; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L272 TraceCheckUtils]: 18: Hoare triple {39418#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38657#true} {39418#(< ~counter~0 43)} #80#return; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L272 TraceCheckUtils]: 13: Hoare triple {39418#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,125 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38657#true} {39418#(< ~counter~0 43)} #78#return; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {38657#true} assume true; {38657#true} is VALID [2022-04-28 13:35:17,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {38657#true} assume !(0 == ~cond); {38657#true} is VALID [2022-04-28 13:35:17,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {38657#true} ~cond := #in~cond; {38657#true} is VALID [2022-04-28 13:35:17,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {39418#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38657#true} is VALID [2022-04-28 13:35:17,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {39418#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {39473#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39418#(< ~counter~0 43)} is VALID [2022-04-28 13:35:17,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {39473#(< ~counter~0 42)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {39473#(< ~counter~0 42)} is VALID [2022-04-28 13:35:17,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {39473#(< ~counter~0 42)} call #t~ret7 := main(); {39473#(< ~counter~0 42)} is VALID [2022-04-28 13:35:17,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39473#(< ~counter~0 42)} {38657#true} #92#return; {39473#(< ~counter~0 42)} is VALID [2022-04-28 13:35:17,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {39473#(< ~counter~0 42)} assume true; {39473#(< ~counter~0 42)} is VALID [2022-04-28 13:35:17,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {38657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {39473#(< ~counter~0 42)} is VALID [2022-04-28 13:35:17,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {38657#true} call ULTIMATE.init(); {38657#true} is VALID [2022-04-28 13:35:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 38 proven. 88 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 13:35:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411255941] [2022-04-28 13:35:17,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479111391] [2022-04-28 13:35:17,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479111391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:17,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:17,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 13:35:17,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1850780078] [2022-04-28 13:35:17,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1850780078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:17,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:17,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:35:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379863791] [2022-04-28 13:35:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 13:35:17,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:17,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:35:17,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:17,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:35:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:35:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 13:35:17,193 INFO L87 Difference]: Start difference. First operand 385 states and 427 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:35:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:18,603 INFO L93 Difference]: Finished difference Result 477 states and 538 transitions. [2022-04-28 13:35:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 13:35:18,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) Word has length 136 [2022-04-28 13:35:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:35:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 13:35:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:35:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 193 transitions. [2022-04-28 13:35:18,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 193 transitions. [2022-04-28 13:35:18,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:18,812 INFO L225 Difference]: With dead ends: 477 [2022-04-28 13:35:18,812 INFO L226 Difference]: Without dead ends: 464 [2022-04-28 13:35:18,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2022-04-28 13:35:18,816 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:18,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 239 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 13:35:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-04-28 13:35:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 463. [2022-04-28 13:35:19,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:19,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-28 13:35:19,449 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-28 13:35:19,450 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-28 13:35:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:19,457 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2022-04-28 13:35:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 518 transitions. [2022-04-28 13:35:19,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:19,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:19,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 464 states. [2022-04-28 13:35:19,458 INFO L87 Difference]: Start difference. First operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) Second operand 464 states. [2022-04-28 13:35:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:19,466 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2022-04-28 13:35:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 518 transitions. [2022-04-28 13:35:19,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:19,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:19,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:19,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 318 states have (on average 1.1037735849056605) internal successors, (351), 324 states have internal predecessors, (351), 84 states have call successors, (84), 61 states have call predecessors, (84), 60 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-28 13:35:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 517 transitions. [2022-04-28 13:35:19,477 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 517 transitions. Word has length 136 [2022-04-28 13:35:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:19,477 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 517 transitions. [2022-04-28 13:35:19,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 11 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (20), 9 states have call predecessors, (20), 9 states have call successors, (20) [2022-04-28 13:35:19,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 463 states and 517 transitions. [2022-04-28 13:35:20,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 517 transitions. [2022-04-28 13:35:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-28 13:35:20,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:20,569 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:20,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 13:35:20,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 13:35:20,783 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 13 times [2022-04-28 13:35:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:20,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332223178] [2022-04-28 13:35:24,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:24,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1618957110, now seen corresponding path program 14 times [2022-04-28 13:35:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:24,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562671474] [2022-04-28 13:35:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:24,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:24,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459931097] [2022-04-28 13:35:24,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:35:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:24,905 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:24,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 13:35:24,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:35:24,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:24,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 13:35:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:25,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:25,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {42312#true} call ULTIMATE.init(); {42312#true} is VALID [2022-04-28 13:35:25,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {42312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42320#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:25,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {42320#(<= ~counter~0 0)} assume true; {42320#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:25,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42320#(<= ~counter~0 0)} {42312#true} #92#return; {42320#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:25,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {42320#(<= ~counter~0 0)} call #t~ret7 := main(); {42320#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:25,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {42320#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42320#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:25,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {42320#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {42336#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,769 INFO L272 TraceCheckUtils]: 8: Hoare triple {42336#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {42336#(<= ~counter~0 1)} ~cond := #in~cond; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {42336#(<= ~counter~0 1)} assume !(0 == ~cond); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {42336#(<= ~counter~0 1)} assume true; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42336#(<= ~counter~0 1)} {42336#(<= ~counter~0 1)} #78#return; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {42336#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {42336#(<= ~counter~0 1)} ~cond := #in~cond; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {42336#(<= ~counter~0 1)} assume !(0 == ~cond); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {42336#(<= ~counter~0 1)} assume true; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42336#(<= ~counter~0 1)} {42336#(<= ~counter~0 1)} #80#return; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {42336#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {42336#(<= ~counter~0 1)} ~cond := #in~cond; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {42336#(<= ~counter~0 1)} assume !(0 == ~cond); {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {42336#(<= ~counter~0 1)} assume true; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42336#(<= ~counter~0 1)} {42336#(<= ~counter~0 1)} #82#return; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {42336#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42336#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:25,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {42336#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {42391#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,773 INFO L272 TraceCheckUtils]: 26: Hoare triple {42391#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {42391#(<= ~counter~0 2)} ~cond := #in~cond; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {42391#(<= ~counter~0 2)} assume !(0 == ~cond); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {42391#(<= ~counter~0 2)} assume true; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,774 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42391#(<= ~counter~0 2)} {42391#(<= ~counter~0 2)} #78#return; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,775 INFO L272 TraceCheckUtils]: 31: Hoare triple {42391#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {42391#(<= ~counter~0 2)} ~cond := #in~cond; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {42391#(<= ~counter~0 2)} assume !(0 == ~cond); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {42391#(<= ~counter~0 2)} assume true; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,776 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42391#(<= ~counter~0 2)} {42391#(<= ~counter~0 2)} #80#return; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,776 INFO L272 TraceCheckUtils]: 36: Hoare triple {42391#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {42391#(<= ~counter~0 2)} ~cond := #in~cond; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {42391#(<= ~counter~0 2)} assume !(0 == ~cond); {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {42391#(<= ~counter~0 2)} assume true; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,777 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42391#(<= ~counter~0 2)} {42391#(<= ~counter~0 2)} #82#return; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {42391#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {42391#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:25,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {42391#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {42446#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,778 INFO L272 TraceCheckUtils]: 44: Hoare triple {42446#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {42446#(<= ~counter~0 3)} ~cond := #in~cond; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {42446#(<= ~counter~0 3)} assume !(0 == ~cond); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {42446#(<= ~counter~0 3)} assume true; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,779 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42446#(<= ~counter~0 3)} {42446#(<= ~counter~0 3)} #78#return; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,779 INFO L272 TraceCheckUtils]: 49: Hoare triple {42446#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {42446#(<= ~counter~0 3)} ~cond := #in~cond; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {42446#(<= ~counter~0 3)} assume !(0 == ~cond); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {42446#(<= ~counter~0 3)} assume true; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,780 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42446#(<= ~counter~0 3)} {42446#(<= ~counter~0 3)} #80#return; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,781 INFO L272 TraceCheckUtils]: 54: Hoare triple {42446#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {42446#(<= ~counter~0 3)} ~cond := #in~cond; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {42446#(<= ~counter~0 3)} assume !(0 == ~cond); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {42446#(<= ~counter~0 3)} assume true; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,782 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42446#(<= ~counter~0 3)} {42446#(<= ~counter~0 3)} #82#return; {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {42446#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {42446#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:25,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {42446#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {42501#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,783 INFO L272 TraceCheckUtils]: 62: Hoare triple {42501#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {42501#(<= ~counter~0 4)} ~cond := #in~cond; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {42501#(<= ~counter~0 4)} assume !(0 == ~cond); {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {42501#(<= ~counter~0 4)} assume true; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,784 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42501#(<= ~counter~0 4)} {42501#(<= ~counter~0 4)} #84#return; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,784 INFO L272 TraceCheckUtils]: 67: Hoare triple {42501#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {42501#(<= ~counter~0 4)} ~cond := #in~cond; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {42501#(<= ~counter~0 4)} assume !(0 == ~cond); {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {42501#(<= ~counter~0 4)} assume true; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,785 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42501#(<= ~counter~0 4)} {42501#(<= ~counter~0 4)} #86#return; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {42501#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {42501#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42501#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:25,786 INFO L290 TraceCheckUtils]: 74: Hoare triple {42501#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {42544#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,787 INFO L272 TraceCheckUtils]: 76: Hoare triple {42544#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {42544#(<= ~counter~0 5)} ~cond := #in~cond; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {42544#(<= ~counter~0 5)} assume !(0 == ~cond); {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,788 INFO L290 TraceCheckUtils]: 79: Hoare triple {42544#(<= ~counter~0 5)} assume true; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,788 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42544#(<= ~counter~0 5)} {42544#(<= ~counter~0 5)} #84#return; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,788 INFO L272 TraceCheckUtils]: 81: Hoare triple {42544#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,788 INFO L290 TraceCheckUtils]: 82: Hoare triple {42544#(<= ~counter~0 5)} ~cond := #in~cond; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,789 INFO L290 TraceCheckUtils]: 83: Hoare triple {42544#(<= ~counter~0 5)} assume !(0 == ~cond); {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {42544#(<= ~counter~0 5)} assume true; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,789 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42544#(<= ~counter~0 5)} {42544#(<= ~counter~0 5)} #86#return; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {42544#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,790 INFO L290 TraceCheckUtils]: 87: Hoare triple {42544#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42544#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:25,790 INFO L290 TraceCheckUtils]: 88: Hoare triple {42544#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,790 INFO L290 TraceCheckUtils]: 89: Hoare triple {42587#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,791 INFO L272 TraceCheckUtils]: 90: Hoare triple {42587#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,791 INFO L290 TraceCheckUtils]: 91: Hoare triple {42587#(<= ~counter~0 6)} ~cond := #in~cond; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,791 INFO L290 TraceCheckUtils]: 92: Hoare triple {42587#(<= ~counter~0 6)} assume !(0 == ~cond); {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {42587#(<= ~counter~0 6)} assume true; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,792 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42587#(<= ~counter~0 6)} {42587#(<= ~counter~0 6)} #84#return; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,792 INFO L272 TraceCheckUtils]: 95: Hoare triple {42587#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,792 INFO L290 TraceCheckUtils]: 96: Hoare triple {42587#(<= ~counter~0 6)} ~cond := #in~cond; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,793 INFO L290 TraceCheckUtils]: 97: Hoare triple {42587#(<= ~counter~0 6)} assume !(0 == ~cond); {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {42587#(<= ~counter~0 6)} assume true; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,793 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42587#(<= ~counter~0 6)} {42587#(<= ~counter~0 6)} #86#return; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {42587#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,793 INFO L290 TraceCheckUtils]: 101: Hoare triple {42587#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42587#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:25,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {42587#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {42630#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,795 INFO L272 TraceCheckUtils]: 104: Hoare triple {42630#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,795 INFO L290 TraceCheckUtils]: 105: Hoare triple {42630#(<= ~counter~0 7)} ~cond := #in~cond; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,795 INFO L290 TraceCheckUtils]: 106: Hoare triple {42630#(<= ~counter~0 7)} assume !(0 == ~cond); {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,795 INFO L290 TraceCheckUtils]: 107: Hoare triple {42630#(<= ~counter~0 7)} assume true; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,796 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42630#(<= ~counter~0 7)} {42630#(<= ~counter~0 7)} #84#return; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,796 INFO L272 TraceCheckUtils]: 109: Hoare triple {42630#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,796 INFO L290 TraceCheckUtils]: 110: Hoare triple {42630#(<= ~counter~0 7)} ~cond := #in~cond; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,796 INFO L290 TraceCheckUtils]: 111: Hoare triple {42630#(<= ~counter~0 7)} assume !(0 == ~cond); {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {42630#(<= ~counter~0 7)} assume true; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,797 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42630#(<= ~counter~0 7)} {42630#(<= ~counter~0 7)} #86#return; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,797 INFO L290 TraceCheckUtils]: 114: Hoare triple {42630#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,797 INFO L290 TraceCheckUtils]: 115: Hoare triple {42630#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42630#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:25,798 INFO L290 TraceCheckUtils]: 116: Hoare triple {42630#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,798 INFO L290 TraceCheckUtils]: 117: Hoare triple {42673#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,799 INFO L272 TraceCheckUtils]: 118: Hoare triple {42673#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,799 INFO L290 TraceCheckUtils]: 119: Hoare triple {42673#(<= ~counter~0 8)} ~cond := #in~cond; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,799 INFO L290 TraceCheckUtils]: 120: Hoare triple {42673#(<= ~counter~0 8)} assume !(0 == ~cond); {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,799 INFO L290 TraceCheckUtils]: 121: Hoare triple {42673#(<= ~counter~0 8)} assume true; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,800 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42673#(<= ~counter~0 8)} {42673#(<= ~counter~0 8)} #84#return; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,800 INFO L272 TraceCheckUtils]: 123: Hoare triple {42673#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,800 INFO L290 TraceCheckUtils]: 124: Hoare triple {42673#(<= ~counter~0 8)} ~cond := #in~cond; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,800 INFO L290 TraceCheckUtils]: 125: Hoare triple {42673#(<= ~counter~0 8)} assume !(0 == ~cond); {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,801 INFO L290 TraceCheckUtils]: 126: Hoare triple {42673#(<= ~counter~0 8)} assume true; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,801 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42673#(<= ~counter~0 8)} {42673#(<= ~counter~0 8)} #86#return; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,801 INFO L290 TraceCheckUtils]: 128: Hoare triple {42673#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,801 INFO L290 TraceCheckUtils]: 129: Hoare triple {42673#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42673#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:25,802 INFO L290 TraceCheckUtils]: 130: Hoare triple {42673#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,802 INFO L290 TraceCheckUtils]: 131: Hoare triple {42716#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,802 INFO L272 TraceCheckUtils]: 132: Hoare triple {42716#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,803 INFO L290 TraceCheckUtils]: 133: Hoare triple {42716#(<= ~counter~0 9)} ~cond := #in~cond; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,803 INFO L290 TraceCheckUtils]: 134: Hoare triple {42716#(<= ~counter~0 9)} assume !(0 == ~cond); {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,803 INFO L290 TraceCheckUtils]: 135: Hoare triple {42716#(<= ~counter~0 9)} assume true; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,803 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42716#(<= ~counter~0 9)} {42716#(<= ~counter~0 9)} #84#return; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,804 INFO L272 TraceCheckUtils]: 137: Hoare triple {42716#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,804 INFO L290 TraceCheckUtils]: 138: Hoare triple {42716#(<= ~counter~0 9)} ~cond := #in~cond; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,804 INFO L290 TraceCheckUtils]: 139: Hoare triple {42716#(<= ~counter~0 9)} assume !(0 == ~cond); {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,804 INFO L290 TraceCheckUtils]: 140: Hoare triple {42716#(<= ~counter~0 9)} assume true; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,805 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42716#(<= ~counter~0 9)} {42716#(<= ~counter~0 9)} #86#return; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,805 INFO L290 TraceCheckUtils]: 142: Hoare triple {42716#(<= ~counter~0 9)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,805 INFO L290 TraceCheckUtils]: 143: Hoare triple {42716#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42716#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:25,805 INFO L290 TraceCheckUtils]: 144: Hoare triple {42716#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42759#(<= |main_#t~post6| 9)} is VALID [2022-04-28 13:35:25,806 INFO L290 TraceCheckUtils]: 145: Hoare triple {42759#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {42313#false} is VALID [2022-04-28 13:35:25,806 INFO L272 TraceCheckUtils]: 146: Hoare triple {42313#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42313#false} is VALID [2022-04-28 13:35:25,806 INFO L290 TraceCheckUtils]: 147: Hoare triple {42313#false} ~cond := #in~cond; {42313#false} is VALID [2022-04-28 13:35:25,806 INFO L290 TraceCheckUtils]: 148: Hoare triple {42313#false} assume 0 == ~cond; {42313#false} is VALID [2022-04-28 13:35:25,806 INFO L290 TraceCheckUtils]: 149: Hoare triple {42313#false} assume !false; {42313#false} is VALID [2022-04-28 13:35:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 900 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 13:35:25,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:26,376 INFO L290 TraceCheckUtils]: 149: Hoare triple {42313#false} assume !false; {42313#false} is VALID [2022-04-28 13:35:26,376 INFO L290 TraceCheckUtils]: 148: Hoare triple {42313#false} assume 0 == ~cond; {42313#false} is VALID [2022-04-28 13:35:26,376 INFO L290 TraceCheckUtils]: 147: Hoare triple {42313#false} ~cond := #in~cond; {42313#false} is VALID [2022-04-28 13:35:26,377 INFO L272 TraceCheckUtils]: 146: Hoare triple {42313#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {42313#false} is VALID [2022-04-28 13:35:26,377 INFO L290 TraceCheckUtils]: 145: Hoare triple {42787#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {42313#false} is VALID [2022-04-28 13:35:26,377 INFO L290 TraceCheckUtils]: 144: Hoare triple {42791#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42787#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:35:26,377 INFO L290 TraceCheckUtils]: 143: Hoare triple {42791#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,377 INFO L290 TraceCheckUtils]: 142: Hoare triple {42791#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,378 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {42312#true} {42791#(< ~counter~0 50)} #86#return; {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 140: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 139: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 138: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L272 TraceCheckUtils]: 137: Hoare triple {42791#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {42312#true} {42791#(< ~counter~0 50)} #84#return; {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 135: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 134: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,378 INFO L290 TraceCheckUtils]: 133: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,379 INFO L272 TraceCheckUtils]: 132: Hoare triple {42791#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,379 INFO L290 TraceCheckUtils]: 131: Hoare triple {42791#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,380 INFO L290 TraceCheckUtils]: 130: Hoare triple {42834#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42791#(< ~counter~0 50)} is VALID [2022-04-28 13:35:26,380 INFO L290 TraceCheckUtils]: 129: Hoare triple {42834#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,380 INFO L290 TraceCheckUtils]: 128: Hoare triple {42834#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,380 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42312#true} {42834#(< ~counter~0 49)} #86#return; {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,380 INFO L290 TraceCheckUtils]: 126: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 125: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L272 TraceCheckUtils]: 123: Hoare triple {42834#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {42312#true} {42834#(< ~counter~0 49)} #84#return; {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L272 TraceCheckUtils]: 118: Hoare triple {42834#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {42834#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,382 INFO L290 TraceCheckUtils]: 116: Hoare triple {42877#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42834#(< ~counter~0 49)} is VALID [2022-04-28 13:35:26,382 INFO L290 TraceCheckUtils]: 115: Hoare triple {42877#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {42877#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,383 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {42312#true} {42877#(< ~counter~0 48)} #86#return; {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 112: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 111: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L272 TraceCheckUtils]: 109: Hoare triple {42877#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {42312#true} {42877#(< ~counter~0 48)} #84#return; {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 107: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,383 INFO L272 TraceCheckUtils]: 104: Hoare triple {42877#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,384 INFO L290 TraceCheckUtils]: 103: Hoare triple {42877#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,384 INFO L290 TraceCheckUtils]: 102: Hoare triple {42920#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42877#(< ~counter~0 48)} is VALID [2022-04-28 13:35:26,384 INFO L290 TraceCheckUtils]: 101: Hoare triple {42920#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {42920#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,385 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42312#true} {42920#(< ~counter~0 47)} #86#return; {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,385 INFO L272 TraceCheckUtils]: 95: Hoare triple {42920#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,385 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42312#true} {42920#(< ~counter~0 47)} #84#return; {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,386 INFO L272 TraceCheckUtils]: 90: Hoare triple {42920#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {42920#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {42963#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42920#(< ~counter~0 47)} is VALID [2022-04-28 13:35:26,387 INFO L290 TraceCheckUtils]: 87: Hoare triple {42963#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {42963#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,387 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {42312#true} {42963#(< ~counter~0 46)} #86#return; {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,387 INFO L290 TraceCheckUtils]: 82: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,387 INFO L272 TraceCheckUtils]: 81: Hoare triple {42963#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,388 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {42312#true} {42963#(< ~counter~0 46)} #84#return; {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,388 INFO L272 TraceCheckUtils]: 76: Hoare triple {42963#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {42963#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 74: Hoare triple {43006#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42963#(< ~counter~0 46)} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {43006#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {43006#(< ~counter~0 45)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,389 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42312#true} {43006#(< ~counter~0 45)} #86#return; {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 70: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,389 INFO L290 TraceCheckUtils]: 68: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L272 TraceCheckUtils]: 67: Hoare triple {43006#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {42312#true} {43006#(< ~counter~0 45)} #84#return; {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L272 TraceCheckUtils]: 62: Hoare triple {43006#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {43006#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {43049#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43006#(< ~counter~0 45)} is VALID [2022-04-28 13:35:26,391 INFO L290 TraceCheckUtils]: 59: Hoare triple {43049#(< ~counter~0 44)} assume !(~r~0 >= ~d~0); {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,391 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {42312#true} {43049#(< ~counter~0 44)} #82#return; {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L272 TraceCheckUtils]: 54: Hoare triple {43049#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {42312#true} {43049#(< ~counter~0 44)} #80#return; {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,392 INFO L272 TraceCheckUtils]: 49: Hoare triple {43049#(< ~counter~0 44)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,397 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {42312#true} {43049#(< ~counter~0 44)} #78#return; {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,397 INFO L272 TraceCheckUtils]: 44: Hoare triple {43049#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {43049#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {43104#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43049#(< ~counter~0 44)} is VALID [2022-04-28 13:35:26,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {43104#(< ~counter~0 43)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,398 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {42312#true} {43104#(< ~counter~0 43)} #82#return; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,399 INFO L272 TraceCheckUtils]: 36: Hoare triple {43104#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,402 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {42312#true} {43104#(< ~counter~0 43)} #80#return; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,403 INFO L272 TraceCheckUtils]: 31: Hoare triple {43104#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,403 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {42312#true} {43104#(< ~counter~0 43)} #78#return; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,403 INFO L272 TraceCheckUtils]: 26: Hoare triple {43104#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {43104#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {43159#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43104#(< ~counter~0 43)} is VALID [2022-04-28 13:35:26,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {43159#(< ~counter~0 42)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,412 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {42312#true} {43159#(< ~counter~0 42)} #82#return; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,412 INFO L272 TraceCheckUtils]: 18: Hoare triple {43159#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,412 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {42312#true} {43159#(< ~counter~0 42)} #80#return; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,413 INFO L272 TraceCheckUtils]: 13: Hoare triple {43159#(< ~counter~0 42)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,420 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42312#true} {43159#(< ~counter~0 42)} #78#return; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {42312#true} assume true; {42312#true} is VALID [2022-04-28 13:35:26,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {42312#true} assume !(0 == ~cond); {42312#true} is VALID [2022-04-28 13:35:26,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {42312#true} ~cond := #in~cond; {42312#true} is VALID [2022-04-28 13:35:26,420 INFO L272 TraceCheckUtils]: 8: Hoare triple {43159#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {42312#true} is VALID [2022-04-28 13:35:26,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {43159#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {43214#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {43159#(< ~counter~0 42)} is VALID [2022-04-28 13:35:26,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {43214#(< ~counter~0 41)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {43214#(< ~counter~0 41)} is VALID [2022-04-28 13:35:26,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {43214#(< ~counter~0 41)} call #t~ret7 := main(); {43214#(< ~counter~0 41)} is VALID [2022-04-28 13:35:26,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43214#(< ~counter~0 41)} {42312#true} #92#return; {43214#(< ~counter~0 41)} is VALID [2022-04-28 13:35:26,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {43214#(< ~counter~0 41)} assume true; {43214#(< ~counter~0 41)} is VALID [2022-04-28 13:35:26,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {42312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43214#(< ~counter~0 41)} is VALID [2022-04-28 13:35:26,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {42312#true} call ULTIMATE.init(); {42312#true} is VALID [2022-04-28 13:35:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 42 proven. 120 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-28 13:35:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562671474] [2022-04-28 13:35:26,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459931097] [2022-04-28 13:35:26,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459931097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:26,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:26,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 13:35:26,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332223178] [2022-04-28 13:35:26,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332223178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:26,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:35:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943573722] [2022-04-28 13:35:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:26,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 13:35:26,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:26,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:35:26,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:26,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:35:26,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:26,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:35:26,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:35:26,499 INFO L87 Difference]: Start difference. First operand 463 states and 517 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:35:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:28,574 INFO L93 Difference]: Finished difference Result 565 states and 641 transitions. [2022-04-28 13:35:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 13:35:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 150 [2022-04-28 13:35:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:35:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 13:35:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:35:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 216 transitions. [2022-04-28 13:35:28,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 216 transitions. [2022-04-28 13:35:28,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:28,833 INFO L225 Difference]: With dead ends: 565 [2022-04-28 13:35:28,833 INFO L226 Difference]: Without dead ends: 552 [2022-04-28 13:35:28,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=514, Unknown=0, NotChecked=0, Total=870 [2022-04-28 13:35:28,835 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 89 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:28,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 297 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:35:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-04-28 13:35:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 551. [2022-04-28 13:35:29,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:29,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 552 states. Second operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:35:29,628 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:35:29,629 INFO L87 Difference]: Start difference. First operand 552 states. Second operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:35:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:29,638 INFO L93 Difference]: Finished difference Result 552 states and 620 transitions. [2022-04-28 13:35:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 620 transitions. [2022-04-28 13:35:29,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:29,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:29,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 552 states. [2022-04-28 13:35:29,640 INFO L87 Difference]: Start difference. First operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) Second operand 552 states. [2022-04-28 13:35:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:29,650 INFO L93 Difference]: Finished difference Result 552 states and 620 transitions. [2022-04-28 13:35:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 620 transitions. [2022-04-28 13:35:29,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:29,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:29,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:29,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 379 states have (on average 1.1055408970976253) internal successors, (419), 386 states have internal predecessors, (419), 101 states have call successors, (101), 71 states have call predecessors, (101), 70 states have return successors, (99), 93 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 13:35:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 619 transitions. [2022-04-28 13:35:29,665 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 619 transitions. Word has length 150 [2022-04-28 13:35:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:29,665 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 619 transitions. [2022-04-28 13:35:29,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-28 13:35:29,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 619 transitions. [2022-04-28 13:35:31,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 619 edges. 619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 619 transitions. [2022-04-28 13:35:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 13:35:31,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:31,064 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 8, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:31,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 13:35:31,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:31,264 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 15 times [2022-04-28 13:35:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:31,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971145247] [2022-04-28 13:35:31,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:31,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 778901090, now seen corresponding path program 16 times [2022-04-28 13:35:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831195522] [2022-04-28 13:35:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:31,905 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:31,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902132678] [2022-04-28 13:35:31,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:35:31,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:31,906 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 13:35:38,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:35:38,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:38,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 13:35:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:38,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:39,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {46583#true} call ULTIMATE.init(); {46583#true} is VALID [2022-04-28 13:35:39,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {46583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {46591#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:39,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {46591#(<= ~counter~0 0)} assume true; {46591#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:39,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46591#(<= ~counter~0 0)} {46583#true} #92#return; {46591#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:39,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {46591#(<= ~counter~0 0)} call #t~ret7 := main(); {46591#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:39,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {46591#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {46591#(<= ~counter~0 0)} is VALID [2022-04-28 13:35:39,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {46591#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {46607#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,586 INFO L272 TraceCheckUtils]: 8: Hoare triple {46607#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {46607#(<= ~counter~0 1)} ~cond := #in~cond; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {46607#(<= ~counter~0 1)} assume !(0 == ~cond); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {46607#(<= ~counter~0 1)} assume true; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,587 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46607#(<= ~counter~0 1)} {46607#(<= ~counter~0 1)} #78#return; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {46607#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {46607#(<= ~counter~0 1)} ~cond := #in~cond; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {46607#(<= ~counter~0 1)} assume !(0 == ~cond); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {46607#(<= ~counter~0 1)} assume true; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,589 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46607#(<= ~counter~0 1)} {46607#(<= ~counter~0 1)} #80#return; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,589 INFO L272 TraceCheckUtils]: 18: Hoare triple {46607#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {46607#(<= ~counter~0 1)} ~cond := #in~cond; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {46607#(<= ~counter~0 1)} assume !(0 == ~cond); {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {46607#(<= ~counter~0 1)} assume true; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,591 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46607#(<= ~counter~0 1)} {46607#(<= ~counter~0 1)} #82#return; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {46607#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46607#(<= ~counter~0 1)} is VALID [2022-04-28 13:35:39,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {46607#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {46662#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {46662#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {46662#(<= ~counter~0 2)} ~cond := #in~cond; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {46662#(<= ~counter~0 2)} assume !(0 == ~cond); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {46662#(<= ~counter~0 2)} assume true; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,594 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46662#(<= ~counter~0 2)} {46662#(<= ~counter~0 2)} #78#return; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,594 INFO L272 TraceCheckUtils]: 31: Hoare triple {46662#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {46662#(<= ~counter~0 2)} ~cond := #in~cond; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {46662#(<= ~counter~0 2)} assume !(0 == ~cond); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {46662#(<= ~counter~0 2)} assume true; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,595 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46662#(<= ~counter~0 2)} {46662#(<= ~counter~0 2)} #80#return; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,596 INFO L272 TraceCheckUtils]: 36: Hoare triple {46662#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {46662#(<= ~counter~0 2)} ~cond := #in~cond; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {46662#(<= ~counter~0 2)} assume !(0 == ~cond); {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {46662#(<= ~counter~0 2)} assume true; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,597 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46662#(<= ~counter~0 2)} {46662#(<= ~counter~0 2)} #82#return; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {46662#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {46662#(<= ~counter~0 2)} is VALID [2022-04-28 13:35:39,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {46662#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {46717#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,599 INFO L272 TraceCheckUtils]: 44: Hoare triple {46717#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {46717#(<= ~counter~0 3)} ~cond := #in~cond; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {46717#(<= ~counter~0 3)} assume !(0 == ~cond); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {46717#(<= ~counter~0 3)} assume true; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,617 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46717#(<= ~counter~0 3)} {46717#(<= ~counter~0 3)} #78#return; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,617 INFO L272 TraceCheckUtils]: 49: Hoare triple {46717#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {46717#(<= ~counter~0 3)} ~cond := #in~cond; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {46717#(<= ~counter~0 3)} assume !(0 == ~cond); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {46717#(<= ~counter~0 3)} assume true; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,619 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46717#(<= ~counter~0 3)} {46717#(<= ~counter~0 3)} #80#return; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,619 INFO L272 TraceCheckUtils]: 54: Hoare triple {46717#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {46717#(<= ~counter~0 3)} ~cond := #in~cond; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {46717#(<= ~counter~0 3)} assume !(0 == ~cond); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {46717#(<= ~counter~0 3)} assume true; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,620 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46717#(<= ~counter~0 3)} {46717#(<= ~counter~0 3)} #82#return; {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {46717#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {46717#(<= ~counter~0 3)} is VALID [2022-04-28 13:35:39,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {46717#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {46772#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,623 INFO L272 TraceCheckUtils]: 62: Hoare triple {46772#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {46772#(<= ~counter~0 4)} ~cond := #in~cond; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {46772#(<= ~counter~0 4)} assume !(0 == ~cond); {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {46772#(<= ~counter~0 4)} assume true; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,624 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46772#(<= ~counter~0 4)} {46772#(<= ~counter~0 4)} #84#return; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,624 INFO L272 TraceCheckUtils]: 67: Hoare triple {46772#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {46772#(<= ~counter~0 4)} ~cond := #in~cond; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {46772#(<= ~counter~0 4)} assume !(0 == ~cond); {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {46772#(<= ~counter~0 4)} assume true; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,626 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46772#(<= ~counter~0 4)} {46772#(<= ~counter~0 4)} #86#return; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {46772#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {46772#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46772#(<= ~counter~0 4)} is VALID [2022-04-28 13:35:39,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {46772#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {46815#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,628 INFO L272 TraceCheckUtils]: 76: Hoare triple {46815#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {46815#(<= ~counter~0 5)} ~cond := #in~cond; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,628 INFO L290 TraceCheckUtils]: 78: Hoare triple {46815#(<= ~counter~0 5)} assume !(0 == ~cond); {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,629 INFO L290 TraceCheckUtils]: 79: Hoare triple {46815#(<= ~counter~0 5)} assume true; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,629 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {46815#(<= ~counter~0 5)} {46815#(<= ~counter~0 5)} #84#return; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,629 INFO L272 TraceCheckUtils]: 81: Hoare triple {46815#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,630 INFO L290 TraceCheckUtils]: 82: Hoare triple {46815#(<= ~counter~0 5)} ~cond := #in~cond; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,630 INFO L290 TraceCheckUtils]: 83: Hoare triple {46815#(<= ~counter~0 5)} assume !(0 == ~cond); {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,630 INFO L290 TraceCheckUtils]: 84: Hoare triple {46815#(<= ~counter~0 5)} assume true; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,631 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {46815#(<= ~counter~0 5)} {46815#(<= ~counter~0 5)} #86#return; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,631 INFO L290 TraceCheckUtils]: 86: Hoare triple {46815#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,631 INFO L290 TraceCheckUtils]: 87: Hoare triple {46815#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46815#(<= ~counter~0 5)} is VALID [2022-04-28 13:35:39,632 INFO L290 TraceCheckUtils]: 88: Hoare triple {46815#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,632 INFO L290 TraceCheckUtils]: 89: Hoare triple {46858#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,633 INFO L272 TraceCheckUtils]: 90: Hoare triple {46858#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,633 INFO L290 TraceCheckUtils]: 91: Hoare triple {46858#(<= ~counter~0 6)} ~cond := #in~cond; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,633 INFO L290 TraceCheckUtils]: 92: Hoare triple {46858#(<= ~counter~0 6)} assume !(0 == ~cond); {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,634 INFO L290 TraceCheckUtils]: 93: Hoare triple {46858#(<= ~counter~0 6)} assume true; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,634 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {46858#(<= ~counter~0 6)} {46858#(<= ~counter~0 6)} #84#return; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,635 INFO L272 TraceCheckUtils]: 95: Hoare triple {46858#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,635 INFO L290 TraceCheckUtils]: 96: Hoare triple {46858#(<= ~counter~0 6)} ~cond := #in~cond; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,635 INFO L290 TraceCheckUtils]: 97: Hoare triple {46858#(<= ~counter~0 6)} assume !(0 == ~cond); {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,635 INFO L290 TraceCheckUtils]: 98: Hoare triple {46858#(<= ~counter~0 6)} assume true; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,636 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {46858#(<= ~counter~0 6)} {46858#(<= ~counter~0 6)} #86#return; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,636 INFO L290 TraceCheckUtils]: 100: Hoare triple {46858#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,636 INFO L290 TraceCheckUtils]: 101: Hoare triple {46858#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46858#(<= ~counter~0 6)} is VALID [2022-04-28 13:35:39,637 INFO L290 TraceCheckUtils]: 102: Hoare triple {46858#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,638 INFO L290 TraceCheckUtils]: 103: Hoare triple {46901#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,638 INFO L272 TraceCheckUtils]: 104: Hoare triple {46901#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,638 INFO L290 TraceCheckUtils]: 105: Hoare triple {46901#(<= ~counter~0 7)} ~cond := #in~cond; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,639 INFO L290 TraceCheckUtils]: 106: Hoare triple {46901#(<= ~counter~0 7)} assume !(0 == ~cond); {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,639 INFO L290 TraceCheckUtils]: 107: Hoare triple {46901#(<= ~counter~0 7)} assume true; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,639 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {46901#(<= ~counter~0 7)} {46901#(<= ~counter~0 7)} #84#return; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,640 INFO L272 TraceCheckUtils]: 109: Hoare triple {46901#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,640 INFO L290 TraceCheckUtils]: 110: Hoare triple {46901#(<= ~counter~0 7)} ~cond := #in~cond; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,640 INFO L290 TraceCheckUtils]: 111: Hoare triple {46901#(<= ~counter~0 7)} assume !(0 == ~cond); {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,641 INFO L290 TraceCheckUtils]: 112: Hoare triple {46901#(<= ~counter~0 7)} assume true; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,641 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {46901#(<= ~counter~0 7)} {46901#(<= ~counter~0 7)} #86#return; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,641 INFO L290 TraceCheckUtils]: 114: Hoare triple {46901#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,642 INFO L290 TraceCheckUtils]: 115: Hoare triple {46901#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46901#(<= ~counter~0 7)} is VALID [2022-04-28 13:35:39,643 INFO L290 TraceCheckUtils]: 116: Hoare triple {46901#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,643 INFO L290 TraceCheckUtils]: 117: Hoare triple {46944#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,643 INFO L272 TraceCheckUtils]: 118: Hoare triple {46944#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,644 INFO L290 TraceCheckUtils]: 119: Hoare triple {46944#(<= ~counter~0 8)} ~cond := #in~cond; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,644 INFO L290 TraceCheckUtils]: 120: Hoare triple {46944#(<= ~counter~0 8)} assume !(0 == ~cond); {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,644 INFO L290 TraceCheckUtils]: 121: Hoare triple {46944#(<= ~counter~0 8)} assume true; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,645 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {46944#(<= ~counter~0 8)} {46944#(<= ~counter~0 8)} #84#return; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,645 INFO L272 TraceCheckUtils]: 123: Hoare triple {46944#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,645 INFO L290 TraceCheckUtils]: 124: Hoare triple {46944#(<= ~counter~0 8)} ~cond := #in~cond; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,646 INFO L290 TraceCheckUtils]: 125: Hoare triple {46944#(<= ~counter~0 8)} assume !(0 == ~cond); {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,646 INFO L290 TraceCheckUtils]: 126: Hoare triple {46944#(<= ~counter~0 8)} assume true; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,646 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {46944#(<= ~counter~0 8)} {46944#(<= ~counter~0 8)} #86#return; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,647 INFO L290 TraceCheckUtils]: 128: Hoare triple {46944#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,647 INFO L290 TraceCheckUtils]: 129: Hoare triple {46944#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46944#(<= ~counter~0 8)} is VALID [2022-04-28 13:35:39,648 INFO L290 TraceCheckUtils]: 130: Hoare triple {46944#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,648 INFO L290 TraceCheckUtils]: 131: Hoare triple {46987#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,649 INFO L272 TraceCheckUtils]: 132: Hoare triple {46987#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,649 INFO L290 TraceCheckUtils]: 133: Hoare triple {46987#(<= ~counter~0 9)} ~cond := #in~cond; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,649 INFO L290 TraceCheckUtils]: 134: Hoare triple {46987#(<= ~counter~0 9)} assume !(0 == ~cond); {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,650 INFO L290 TraceCheckUtils]: 135: Hoare triple {46987#(<= ~counter~0 9)} assume true; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,650 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {46987#(<= ~counter~0 9)} {46987#(<= ~counter~0 9)} #84#return; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,650 INFO L272 TraceCheckUtils]: 137: Hoare triple {46987#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,651 INFO L290 TraceCheckUtils]: 138: Hoare triple {46987#(<= ~counter~0 9)} ~cond := #in~cond; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,651 INFO L290 TraceCheckUtils]: 139: Hoare triple {46987#(<= ~counter~0 9)} assume !(0 == ~cond); {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,651 INFO L290 TraceCheckUtils]: 140: Hoare triple {46987#(<= ~counter~0 9)} assume true; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,652 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {46987#(<= ~counter~0 9)} {46987#(<= ~counter~0 9)} #86#return; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,652 INFO L290 TraceCheckUtils]: 142: Hoare triple {46987#(<= ~counter~0 9)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,652 INFO L290 TraceCheckUtils]: 143: Hoare triple {46987#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {46987#(<= ~counter~0 9)} is VALID [2022-04-28 13:35:39,653 INFO L290 TraceCheckUtils]: 144: Hoare triple {46987#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,653 INFO L290 TraceCheckUtils]: 145: Hoare triple {47030#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,654 INFO L272 TraceCheckUtils]: 146: Hoare triple {47030#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,654 INFO L290 TraceCheckUtils]: 147: Hoare triple {47030#(<= ~counter~0 10)} ~cond := #in~cond; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,655 INFO L290 TraceCheckUtils]: 148: Hoare triple {47030#(<= ~counter~0 10)} assume !(0 == ~cond); {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,655 INFO L290 TraceCheckUtils]: 149: Hoare triple {47030#(<= ~counter~0 10)} assume true; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,655 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {47030#(<= ~counter~0 10)} {47030#(<= ~counter~0 10)} #84#return; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,656 INFO L272 TraceCheckUtils]: 151: Hoare triple {47030#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,656 INFO L290 TraceCheckUtils]: 152: Hoare triple {47030#(<= ~counter~0 10)} ~cond := #in~cond; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,656 INFO L290 TraceCheckUtils]: 153: Hoare triple {47030#(<= ~counter~0 10)} assume !(0 == ~cond); {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,656 INFO L290 TraceCheckUtils]: 154: Hoare triple {47030#(<= ~counter~0 10)} assume true; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,657 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {47030#(<= ~counter~0 10)} {47030#(<= ~counter~0 10)} #86#return; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,657 INFO L290 TraceCheckUtils]: 156: Hoare triple {47030#(<= ~counter~0 10)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,657 INFO L290 TraceCheckUtils]: 157: Hoare triple {47030#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47030#(<= ~counter~0 10)} is VALID [2022-04-28 13:35:39,658 INFO L290 TraceCheckUtils]: 158: Hoare triple {47030#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47073#(<= |main_#t~post6| 10)} is VALID [2022-04-28 13:35:39,658 INFO L290 TraceCheckUtils]: 159: Hoare triple {47073#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {46584#false} is VALID [2022-04-28 13:35:39,658 INFO L272 TraceCheckUtils]: 160: Hoare triple {46584#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46584#false} is VALID [2022-04-28 13:35:39,658 INFO L290 TraceCheckUtils]: 161: Hoare triple {46584#false} ~cond := #in~cond; {46584#false} is VALID [2022-04-28 13:35:39,658 INFO L290 TraceCheckUtils]: 162: Hoare triple {46584#false} assume 0 == ~cond; {46584#false} is VALID [2022-04-28 13:35:39,658 INFO L290 TraceCheckUtils]: 163: Hoare triple {46584#false} assume !false; {46584#false} is VALID [2022-04-28 13:35:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 46 proven. 1106 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 13:35:39,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:40,513 INFO L290 TraceCheckUtils]: 163: Hoare triple {46584#false} assume !false; {46584#false} is VALID [2022-04-28 13:35:40,513 INFO L290 TraceCheckUtils]: 162: Hoare triple {46584#false} assume 0 == ~cond; {46584#false} is VALID [2022-04-28 13:35:40,513 INFO L290 TraceCheckUtils]: 161: Hoare triple {46584#false} ~cond := #in~cond; {46584#false} is VALID [2022-04-28 13:35:40,514 INFO L272 TraceCheckUtils]: 160: Hoare triple {46584#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {46584#false} is VALID [2022-04-28 13:35:40,514 INFO L290 TraceCheckUtils]: 159: Hoare triple {47101#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {46584#false} is VALID [2022-04-28 13:35:40,514 INFO L290 TraceCheckUtils]: 158: Hoare triple {47105#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47101#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:35:40,514 INFO L290 TraceCheckUtils]: 157: Hoare triple {47105#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,515 INFO L290 TraceCheckUtils]: 156: Hoare triple {47105#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,515 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {46583#true} {47105#(< ~counter~0 50)} #86#return; {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,515 INFO L290 TraceCheckUtils]: 154: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,515 INFO L290 TraceCheckUtils]: 153: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,515 INFO L290 TraceCheckUtils]: 152: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,516 INFO L272 TraceCheckUtils]: 151: Hoare triple {47105#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,516 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {46583#true} {47105#(< ~counter~0 50)} #84#return; {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,516 INFO L290 TraceCheckUtils]: 149: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,516 INFO L290 TraceCheckUtils]: 148: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,516 INFO L290 TraceCheckUtils]: 147: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,516 INFO L272 TraceCheckUtils]: 146: Hoare triple {47105#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,517 INFO L290 TraceCheckUtils]: 145: Hoare triple {47105#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,518 INFO L290 TraceCheckUtils]: 144: Hoare triple {47148#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47105#(< ~counter~0 50)} is VALID [2022-04-28 13:35:40,518 INFO L290 TraceCheckUtils]: 143: Hoare triple {47148#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,518 INFO L290 TraceCheckUtils]: 142: Hoare triple {47148#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,519 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {46583#true} {47148#(< ~counter~0 49)} #86#return; {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,519 INFO L290 TraceCheckUtils]: 140: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,519 INFO L290 TraceCheckUtils]: 139: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,519 INFO L290 TraceCheckUtils]: 138: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,519 INFO L272 TraceCheckUtils]: 137: Hoare triple {47148#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,519 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {46583#true} {47148#(< ~counter~0 49)} #84#return; {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,520 INFO L290 TraceCheckUtils]: 135: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,520 INFO L290 TraceCheckUtils]: 134: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,520 INFO L290 TraceCheckUtils]: 133: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,520 INFO L272 TraceCheckUtils]: 132: Hoare triple {47148#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {47148#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,521 INFO L290 TraceCheckUtils]: 130: Hoare triple {47191#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47148#(< ~counter~0 49)} is VALID [2022-04-28 13:35:40,521 INFO L290 TraceCheckUtils]: 129: Hoare triple {47191#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,521 INFO L290 TraceCheckUtils]: 128: Hoare triple {47191#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,522 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {46583#true} {47191#(< ~counter~0 48)} #86#return; {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,522 INFO L290 TraceCheckUtils]: 126: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,522 INFO L290 TraceCheckUtils]: 125: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,522 INFO L290 TraceCheckUtils]: 124: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,522 INFO L272 TraceCheckUtils]: 123: Hoare triple {47191#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,522 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {46583#true} {47191#(< ~counter~0 48)} #84#return; {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,523 INFO L290 TraceCheckUtils]: 121: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,523 INFO L290 TraceCheckUtils]: 120: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,523 INFO L290 TraceCheckUtils]: 119: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,523 INFO L272 TraceCheckUtils]: 118: Hoare triple {47191#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,523 INFO L290 TraceCheckUtils]: 117: Hoare triple {47191#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,524 INFO L290 TraceCheckUtils]: 116: Hoare triple {47234#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47191#(< ~counter~0 48)} is VALID [2022-04-28 13:35:40,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {47234#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {47234#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,525 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {46583#true} {47234#(< ~counter~0 47)} #86#return; {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,525 INFO L290 TraceCheckUtils]: 112: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,525 INFO L290 TraceCheckUtils]: 111: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,525 INFO L290 TraceCheckUtils]: 110: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,525 INFO L272 TraceCheckUtils]: 109: Hoare triple {47234#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,525 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {46583#true} {47234#(< ~counter~0 47)} #84#return; {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,525 INFO L290 TraceCheckUtils]: 107: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,526 INFO L290 TraceCheckUtils]: 106: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,526 INFO L290 TraceCheckUtils]: 105: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,526 INFO L272 TraceCheckUtils]: 104: Hoare triple {47234#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,526 INFO L290 TraceCheckUtils]: 103: Hoare triple {47234#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {47277#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47234#(< ~counter~0 47)} is VALID [2022-04-28 13:35:40,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {47277#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,527 INFO L290 TraceCheckUtils]: 100: Hoare triple {47277#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,528 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {46583#true} {47277#(< ~counter~0 46)} #86#return; {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,528 INFO L272 TraceCheckUtils]: 95: Hoare triple {47277#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,528 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {46583#true} {47277#(< ~counter~0 46)} #84#return; {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,528 INFO L290 TraceCheckUtils]: 92: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,529 INFO L290 TraceCheckUtils]: 91: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,529 INFO L272 TraceCheckUtils]: 90: Hoare triple {47277#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,529 INFO L290 TraceCheckUtils]: 89: Hoare triple {47277#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {47320#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47277#(< ~counter~0 46)} is VALID [2022-04-28 13:35:40,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {47320#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {47320#(< ~counter~0 45)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,531 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {46583#true} {47320#(< ~counter~0 45)} #86#return; {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 84: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 83: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 82: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L272 TraceCheckUtils]: 81: Hoare triple {47320#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {46583#true} {47320#(< ~counter~0 45)} #84#return; {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 78: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,531 INFO L290 TraceCheckUtils]: 77: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,532 INFO L272 TraceCheckUtils]: 76: Hoare triple {47320#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,532 INFO L290 TraceCheckUtils]: 75: Hoare triple {47320#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {47363#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47320#(< ~counter~0 45)} is VALID [2022-04-28 13:35:40,533 INFO L290 TraceCheckUtils]: 73: Hoare triple {47363#(< ~counter~0 44)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,533 INFO L290 TraceCheckUtils]: 72: Hoare triple {47363#(< ~counter~0 44)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,533 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {46583#true} {47363#(< ~counter~0 44)} #86#return; {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L272 TraceCheckUtils]: 67: Hoare triple {47363#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {46583#true} {47363#(< ~counter~0 44)} #84#return; {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 65: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,534 INFO L272 TraceCheckUtils]: 62: Hoare triple {47363#(< ~counter~0 44)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {47363#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {47406#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47363#(< ~counter~0 44)} is VALID [2022-04-28 13:35:40,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {47406#(< ~counter~0 43)} assume !(~r~0 >= ~d~0); {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,536 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {46583#true} {47406#(< ~counter~0 43)} #82#return; {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,536 INFO L290 TraceCheckUtils]: 56: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,536 INFO L272 TraceCheckUtils]: 54: Hoare triple {47406#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,537 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {46583#true} {47406#(< ~counter~0 43)} #80#return; {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,537 INFO L272 TraceCheckUtils]: 49: Hoare triple {47406#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,537 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {46583#true} {47406#(< ~counter~0 43)} #78#return; {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,538 INFO L272 TraceCheckUtils]: 44: Hoare triple {47406#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {47406#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {47461#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47406#(< ~counter~0 43)} is VALID [2022-04-28 13:35:40,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {47461#(< ~counter~0 42)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,539 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {46583#true} {47461#(< ~counter~0 42)} #82#return; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L272 TraceCheckUtils]: 36: Hoare triple {47461#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {46583#true} {47461#(< ~counter~0 42)} #80#return; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,540 INFO L272 TraceCheckUtils]: 31: Hoare triple {47461#(< ~counter~0 42)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,541 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {46583#true} {47461#(< ~counter~0 42)} #78#return; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,541 INFO L272 TraceCheckUtils]: 26: Hoare triple {47461#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {47461#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {47516#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47461#(< ~counter~0 42)} is VALID [2022-04-28 13:35:40,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {47516#(< ~counter~0 41)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,543 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {46583#true} {47516#(< ~counter~0 41)} #82#return; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,543 INFO L272 TraceCheckUtils]: 18: Hoare triple {47516#(< ~counter~0 41)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,543 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {46583#true} {47516#(< ~counter~0 41)} #80#return; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L272 TraceCheckUtils]: 13: Hoare triple {47516#(< ~counter~0 41)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {46583#true} {47516#(< ~counter~0 41)} #78#return; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {46583#true} assume true; {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {46583#true} assume !(0 == ~cond); {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {46583#true} ~cond := #in~cond; {46583#true} is VALID [2022-04-28 13:35:40,544 INFO L272 TraceCheckUtils]: 8: Hoare triple {47516#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {46583#true} is VALID [2022-04-28 13:35:40,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {47516#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {47571#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {47516#(< ~counter~0 41)} is VALID [2022-04-28 13:35:40,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {47571#(< ~counter~0 40)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {47571#(< ~counter~0 40)} is VALID [2022-04-28 13:35:40,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {47571#(< ~counter~0 40)} call #t~ret7 := main(); {47571#(< ~counter~0 40)} is VALID [2022-04-28 13:35:40,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47571#(< ~counter~0 40)} {46583#true} #92#return; {47571#(< ~counter~0 40)} is VALID [2022-04-28 13:35:40,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {47571#(< ~counter~0 40)} assume true; {47571#(< ~counter~0 40)} is VALID [2022-04-28 13:35:40,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {46583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47571#(< ~counter~0 40)} is VALID [2022-04-28 13:35:40,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {46583#true} call ULTIMATE.init(); {46583#true} is VALID [2022-04-28 13:35:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 46 proven. 158 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2022-04-28 13:35:40,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831195522] [2022-04-28 13:35:40,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902132678] [2022-04-28 13:35:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902132678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:40,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-28 13:35:40,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971145247] [2022-04-28 13:35:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971145247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:40,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 13:35:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116245245] [2022-04-28 13:35:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:40,549 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 164 [2022-04-28 13:35:40,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:40,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-28 13:35:40,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 13:35:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 13:35:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-28 13:35:40,660 INFO L87 Difference]: Start difference. First operand 551 states and 619 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-28 13:35:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:42,754 INFO L93 Difference]: Finished difference Result 659 states and 750 transitions. [2022-04-28 13:35:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 13:35:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) Word has length 164 [2022-04-28 13:35:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-28 13:35:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-28 13:35:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-28 13:35:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 239 transitions. [2022-04-28 13:35:42,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 239 transitions. [2022-04-28 13:35:42,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:42,926 INFO L225 Difference]: With dead ends: 659 [2022-04-28 13:35:42,926 INFO L226 Difference]: Without dead ends: 646 [2022-04-28 13:35:42,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=621, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 13:35:42,927 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:42,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:35:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-04-28 13:35:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 645. [2022-04-28 13:35:43,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:43,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-28 13:35:43,854 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-28 13:35:43,854 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-28 13:35:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:43,866 INFO L93 Difference]: Finished difference Result 646 states and 729 transitions. [2022-04-28 13:35:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 729 transitions. [2022-04-28 13:35:43,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:43,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:43,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 646 states. [2022-04-28 13:35:43,869 INFO L87 Difference]: Start difference. First operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) Second operand 646 states. [2022-04-28 13:35:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:43,881 INFO L93 Difference]: Finished difference Result 646 states and 729 transitions. [2022-04-28 13:35:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 729 transitions. [2022-04-28 13:35:43,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:43,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:43,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:43,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 443 states have (on average 1.1060948081264108) internal successors, (490), 452 states have internal predecessors, (490), 120 states have call successors, (120), 82 states have call predecessors, (120), 81 states have return successors, (118), 110 states have call predecessors, (118), 118 states have call successors, (118) [2022-04-28 13:35:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 728 transitions. [2022-04-28 13:35:43,908 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 728 transitions. Word has length 164 [2022-04-28 13:35:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:43,908 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 728 transitions. [2022-04-28 13:35:43,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 13 states have internal predecessors, (75), 13 states have call successors, (26), 13 states have call predecessors, (26), 11 states have return successors, (24), 11 states have call predecessors, (24), 11 states have call successors, (24) [2022-04-28 13:35:43,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 645 states and 728 transitions. [2022-04-28 13:35:45,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 728 edges. 728 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 728 transitions. [2022-04-28 13:35:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-04-28 13:35:45,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:45,624 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:45,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 13:35:45,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:45,825 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 17 times [2022-04-28 13:35:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:45,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855420549] [2022-04-28 13:35:49,098 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:49,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 759159950, now seen corresponding path program 18 times [2022-04-28 13:35:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:49,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109664053] [2022-04-28 13:35:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:49,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:49,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607714629] [2022-04-28 13:35:49,119 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:35:49,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:49,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:49,120 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:49,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 13:35:49,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 13:35:49,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:49,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:35:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:49,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:49,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {51506#true} call ULTIMATE.init(); {51506#true} is VALID [2022-04-28 13:35:49,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {51506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51506#true} is VALID [2022-04-28 13:35:49,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51506#true} {51506#true} #92#return; {51506#true} is VALID [2022-04-28 13:35:49,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {51506#true} call #t~ret7 := main(); {51506#true} is VALID [2022-04-28 13:35:49,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {51506#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {51526#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {51526#(= main_~p~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,622 INFO L272 TraceCheckUtils]: 8: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #78#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,622 INFO L272 TraceCheckUtils]: 13: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,623 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #80#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,623 INFO L272 TraceCheckUtils]: 18: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,624 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #82#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {51526#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {51581#(= main_~p~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {51581#(= main_~p~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,625 INFO L272 TraceCheckUtils]: 26: Hoare triple {51581#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {51506#true} {51581#(= main_~p~0 2)} #78#return; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,625 INFO L272 TraceCheckUtils]: 31: Hoare triple {51581#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,626 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {51506#true} {51581#(= main_~p~0 2)} #80#return; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,626 INFO L272 TraceCheckUtils]: 36: Hoare triple {51581#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,627 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51506#true} {51581#(= main_~p~0 2)} #82#return; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {51581#(= main_~p~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {51636#(= main_~p~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {51636#(= main_~p~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,628 INFO L272 TraceCheckUtils]: 44: Hoare triple {51636#(= main_~p~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {51506#true} {51636#(= main_~p~0 4)} #78#return; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,628 INFO L272 TraceCheckUtils]: 49: Hoare triple {51636#(= main_~p~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,629 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {51506#true} {51636#(= main_~p~0 4)} #80#return; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,629 INFO L272 TraceCheckUtils]: 54: Hoare triple {51636#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,629 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {51506#true} {51636#(= main_~p~0 4)} #82#return; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {51636#(= main_~p~0 4)} assume !(~r~0 >= ~d~0); {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {51636#(= main_~p~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {51636#(= main_~p~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,630 INFO L272 TraceCheckUtils]: 62: Hoare triple {51636#(= main_~p~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {51506#true} {51636#(= main_~p~0 4)} #84#return; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,631 INFO L272 TraceCheckUtils]: 67: Hoare triple {51636#(= main_~p~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L290 TraceCheckUtils]: 68: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L290 TraceCheckUtils]: 69: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,631 INFO L290 TraceCheckUtils]: 70: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51506#true} {51636#(= main_~p~0 4)} #86#return; {51636#(= main_~p~0 4)} is VALID [2022-04-28 13:35:49,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {51636#(= 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); {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 73: Hoare triple {51581#(= main_~p~0 2)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 74: Hoare triple {51581#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 75: Hoare triple {51581#(= main_~p~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,633 INFO L272 TraceCheckUtils]: 76: Hoare triple {51581#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,633 INFO L290 TraceCheckUtils]: 79: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,634 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {51506#true} {51581#(= main_~p~0 2)} #84#return; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,634 INFO L272 TraceCheckUtils]: 81: Hoare triple {51581#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,634 INFO L290 TraceCheckUtils]: 82: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,634 INFO L290 TraceCheckUtils]: 83: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,635 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {51506#true} {51581#(= main_~p~0 2)} #86#return; {51581#(= main_~p~0 2)} is VALID [2022-04-28 13:35:49,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {51581#(= main_~p~0 2)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {51526#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,636 INFO L290 TraceCheckUtils]: 88: Hoare triple {51526#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {51526#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,636 INFO L272 TraceCheckUtils]: 90: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,636 INFO L290 TraceCheckUtils]: 91: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,636 INFO L290 TraceCheckUtils]: 92: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,636 INFO L290 TraceCheckUtils]: 93: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,637 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #84#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,637 INFO L272 TraceCheckUtils]: 95: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:49,637 INFO L290 TraceCheckUtils]: 96: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:49,637 INFO L290 TraceCheckUtils]: 97: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:49,637 INFO L290 TraceCheckUtils]: 98: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:49,637 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #86#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 100: Hoare triple {51526#(= main_~p~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 101: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 102: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 103: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L272 TraceCheckUtils]: 104: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 105: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 106: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L290 TraceCheckUtils]: 107: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,638 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {51507#false} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L272 TraceCheckUtils]: 109: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 110: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 111: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 112: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {51507#false} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 114: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 115: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 116: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 117: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L272 TraceCheckUtils]: 118: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 119: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,639 INFO L290 TraceCheckUtils]: 120: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 121: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {51507#false} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L272 TraceCheckUtils]: 123: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 124: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 125: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 126: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51507#false} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 128: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 129: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 130: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,640 INFO L290 TraceCheckUtils]: 131: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L272 TraceCheckUtils]: 132: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 133: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 134: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 135: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {51507#false} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L272 TraceCheckUtils]: 137: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 138: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 139: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 140: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {51507#false} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:49,641 INFO L290 TraceCheckUtils]: 142: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 143: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 144: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 145: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L272 TraceCheckUtils]: 146: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 147: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 148: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 149: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {51507#false} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L272 TraceCheckUtils]: 151: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 152: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 153: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L290 TraceCheckUtils]: 154: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,642 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {51507#false} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 156: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 157: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 158: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 159: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L272 TraceCheckUtils]: 160: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 161: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 162: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 163: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {51507#false} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L272 TraceCheckUtils]: 165: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 166: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 167: Hoare triple {51507#false} assume !(0 == ~cond); {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 168: Hoare triple {51507#false} assume true; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {51507#false} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:49,643 INFO L290 TraceCheckUtils]: 170: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 171: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 172: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 173: Hoare triple {51507#false} assume !(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L272 TraceCheckUtils]: 174: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 175: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 176: Hoare triple {51507#false} assume 0 == ~cond; {51507#false} is VALID [2022-04-28 13:35:49,644 INFO L290 TraceCheckUtils]: 177: Hoare triple {51507#false} assume !false; {51507#false} is VALID [2022-04-28 13:35:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 723 proven. 34 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-04-28 13:35:49,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:35:50,517 INFO L290 TraceCheckUtils]: 177: Hoare triple {51507#false} assume !false; {51507#false} is VALID [2022-04-28 13:35:50,517 INFO L290 TraceCheckUtils]: 176: Hoare triple {51507#false} assume 0 == ~cond; {51507#false} is VALID [2022-04-28 13:35:50,517 INFO L290 TraceCheckUtils]: 175: Hoare triple {51507#false} ~cond := #in~cond; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L272 TraceCheckUtils]: 174: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 173: Hoare triple {51507#false} assume !(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 172: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 171: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 170: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {51506#true} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 168: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 167: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 166: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L272 TraceCheckUtils]: 165: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {51506#true} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 163: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 162: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L290 TraceCheckUtils]: 161: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,518 INFO L272 TraceCheckUtils]: 160: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 159: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 158: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 157: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 156: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {51506#true} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 154: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 153: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 152: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L272 TraceCheckUtils]: 151: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {51506#true} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 149: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 148: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 147: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L272 TraceCheckUtils]: 146: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,519 INFO L290 TraceCheckUtils]: 145: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 144: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 143: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 142: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {51506#true} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 140: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 139: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 138: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L272 TraceCheckUtils]: 137: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {51506#true} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 135: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 134: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 133: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L272 TraceCheckUtils]: 132: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 131: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,520 INFO L290 TraceCheckUtils]: 130: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 129: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 128: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51506#true} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 126: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 125: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 124: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L272 TraceCheckUtils]: 123: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {51506#true} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 121: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 120: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 119: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L272 TraceCheckUtils]: 118: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 117: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 116: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,521 INFO L290 TraceCheckUtils]: 115: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 114: Hoare triple {51507#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {51506#true} {51507#false} #86#return; {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 112: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 111: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L272 TraceCheckUtils]: 109: Hoare triple {51507#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {51506#true} {51507#false} #84#return; {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 107: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L272 TraceCheckUtils]: 104: Hoare triple {51507#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {51507#false} assume !!(#t~post6 < 50);havoc #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {51507#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51507#false} is VALID [2022-04-28 13:35:50,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {51507#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51507#false} is VALID [2022-04-28 13:35:50,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {51526#(= main_~p~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51507#false} is VALID [2022-04-28 13:35:50,523 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #86#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L272 TraceCheckUtils]: 95: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #84#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,524 INFO L272 TraceCheckUtils]: 90: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {51526#(= main_~p~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {51526#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {51526#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {52318#(= (div main_~p~0 2) 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,527 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {51506#true} {52318#(= (div main_~p~0 2) 1)} #86#return; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,527 INFO L290 TraceCheckUtils]: 83: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,527 INFO L272 TraceCheckUtils]: 81: Hoare triple {52318#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,528 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {51506#true} {52318#(= (div main_~p~0 2) 1)} #84#return; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,528 INFO L290 TraceCheckUtils]: 79: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,528 INFO L290 TraceCheckUtils]: 78: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,528 INFO L290 TraceCheckUtils]: 77: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,528 INFO L272 TraceCheckUtils]: 76: Hoare triple {52318#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,528 INFO L290 TraceCheckUtils]: 75: Hoare triple {52318#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 50);havoc #t~post6; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {52318#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,529 INFO L290 TraceCheckUtils]: 73: Hoare triple {52318#(= (div main_~p~0 2) 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,531 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51506#true} {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #86#return; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,531 INFO L272 TraceCheckUtils]: 67: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,531 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {51506#true} {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #84#return; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,532 INFO L272 TraceCheckUtils]: 62: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !(~r~0 >= ~d~0); {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,533 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {51506#true} {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #82#return; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,533 INFO L290 TraceCheckUtils]: 56: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L272 TraceCheckUtils]: 54: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {51506#true} {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #80#return; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,534 INFO L272 TraceCheckUtils]: 49: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,535 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {51506#true} {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #78#return; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,535 INFO L272 TraceCheckUtils]: 44: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} assume !!(#t~post5 < 50);havoc #t~post5; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {52318#(= (div main_~p~0 2) 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52361#(and (<= (div (+ (- 1) (* (- 1) (div main_~p~0 2))) (- 2)) 2) (<= 0 (div (+ (- 2) (div main_~p~0 2)) 2)))} is VALID [2022-04-28 13:35:50,538 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51506#true} {52318#(= (div main_~p~0 2) 1)} #82#return; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,538 INFO L272 TraceCheckUtils]: 36: Hoare triple {52318#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {51506#true} {52318#(= (div main_~p~0 2) 1)} #80#return; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L272 TraceCheckUtils]: 31: Hoare triple {52318#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {51506#true} {52318#(= (div main_~p~0 2) 1)} #78#return; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,539 INFO L272 TraceCheckUtils]: 26: Hoare triple {52318#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {52318#(= (div main_~p~0 2) 1)} assume !!(#t~post5 < 50);havoc #t~post5; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {52318#(= (div main_~p~0 2) 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {51526#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {52318#(= (div main_~p~0 2) 1)} is VALID [2022-04-28 13:35:50,541 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #82#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,541 INFO L272 TraceCheckUtils]: 18: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,541 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #80#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L272 TraceCheckUtils]: 13: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51506#true} {51526#(= main_~p~0 1)} #78#return; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {51506#true} assume !(0 == ~cond); {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {51506#true} ~cond := #in~cond; {51506#true} is VALID [2022-04-28 13:35:50,542 INFO L272 TraceCheckUtils]: 8: Hoare triple {51526#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {51506#true} is VALID [2022-04-28 13:35:50,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {51526#(= main_~p~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {51526#(= main_~p~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {51506#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {51526#(= main_~p~0 1)} is VALID [2022-04-28 13:35:50,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {51506#true} call #t~ret7 := main(); {51506#true} is VALID [2022-04-28 13:35:50,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51506#true} {51506#true} #92#return; {51506#true} is VALID [2022-04-28 13:35:50,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {51506#true} assume true; {51506#true} is VALID [2022-04-28 13:35:50,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {51506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51506#true} is VALID [2022-04-28 13:35:50,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {51506#true} call ULTIMATE.init(); {51506#true} is VALID [2022-04-28 13:35:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 143 proven. 34 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2022-04-28 13:35:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109664053] [2022-04-28 13:35:50,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607714629] [2022-04-28 13:35:50,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607714629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:35:50,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:35:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-04-28 13:35:50,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:50,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855420549] [2022-04-28 13:35:50,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855420549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:50,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:35:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633004888] [2022-04-28 13:35:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:50,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 178 [2022-04-28 13:35:50,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:50,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 13:35:50,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:50,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:35:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:35:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:35:50,598 INFO L87 Difference]: Start difference. First operand 645 states and 728 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 13:35:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:51,557 INFO L93 Difference]: Finished difference Result 701 states and 793 transitions. [2022-04-28 13:35:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:35:51,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 178 [2022-04-28 13:35:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 13:35:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-28 13:35:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 13:35:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-04-28 13:35:51,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2022-04-28 13:35:51,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:51,674 INFO L225 Difference]: With dead ends: 701 [2022-04-28 13:35:51,674 INFO L226 Difference]: Without dead ends: 547 [2022-04-28 13:35:51,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 348 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 13:35:51,676 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:51,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:35:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-28 13:35:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2022-04-28 13:35:52,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:52,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-28 13:35:52,260 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-28 13:35:52,261 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-28 13:35:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:52,270 INFO L93 Difference]: Finished difference Result 547 states and 615 transitions. [2022-04-28 13:35:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 615 transitions. [2022-04-28 13:35:52,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:52,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:52,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 547 states. [2022-04-28 13:35:52,272 INFO L87 Difference]: Start difference. First operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) Second operand 547 states. [2022-04-28 13:35:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:52,281 INFO L93 Difference]: Finished difference Result 547 states and 615 transitions. [2022-04-28 13:35:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 615 transitions. [2022-04-28 13:35:52,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:52,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:52,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:52,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 374 states have (on average 1.1042780748663101) internal successors, (413), 382 states have internal predecessors, (413), 102 states have call successors, (102), 71 states have call predecessors, (102), 70 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2022-04-28 13:35:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 615 transitions. [2022-04-28 13:35:52,297 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 615 transitions. Word has length 178 [2022-04-28 13:35:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:52,297 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 615 transitions. [2022-04-28 13:35:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 13:35:52,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 547 states and 615 transitions. [2022-04-28 13:35:53,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 615 transitions. [2022-04-28 13:35:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 13:35:53,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:53,803 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:53,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 13:35:54,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:54,004 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:35:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:35:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 5 times [2022-04-28 13:35:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:54,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17561999] [2022-04-28 13:35:56,141 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:35:56,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:35:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash 221596463, now seen corresponding path program 6 times [2022-04-28 13:35:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:35:56,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664438565] [2022-04-28 13:35:56,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:35:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:35:56,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:35:56,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943589362] [2022-04-28 13:35:56,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:35:56,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:35:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:35:56,155 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:35:56,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 13:35:56,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 13:35:56,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:35:56,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 13:35:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:35:56,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:35:56,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {56170#true} call ULTIMATE.init(); {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {56170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56170#true} {56170#true} #92#return; {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {56170#true} call #t~ret7 := main(); {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {56170#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {56170#true} is VALID [2022-04-28 13:35:56,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L272 TraceCheckUtils]: 8: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L272 TraceCheckUtils]: 13: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L272 TraceCheckUtils]: 18: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,584 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L272 TraceCheckUtils]: 26: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L272 TraceCheckUtils]: 31: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,585 INFO L272 TraceCheckUtils]: 36: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L272 TraceCheckUtils]: 44: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L272 TraceCheckUtils]: 49: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L272 TraceCheckUtils]: 54: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 59: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L272 TraceCheckUtils]: 62: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,587 INFO L272 TraceCheckUtils]: 67: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 68: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 69: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 70: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L272 TraceCheckUtils]: 72: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 75: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 79: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L272 TraceCheckUtils]: 80: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 82: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,588 INFO L290 TraceCheckUtils]: 83: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L272 TraceCheckUtils]: 85: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 86: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 87: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 88: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L272 TraceCheckUtils]: 90: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 91: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 95: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L272 TraceCheckUtils]: 98: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,589 INFO L290 TraceCheckUtils]: 99: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L272 TraceCheckUtils]: 103: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 104: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 105: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 106: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L272 TraceCheckUtils]: 108: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 109: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 111: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 113: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,590 INFO L290 TraceCheckUtils]: 114: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 115: Hoare triple {56170#true} assume !!(#t~post5 < 50);havoc #t~post5; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L272 TraceCheckUtils]: 116: Hoare triple {56170#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 117: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 118: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 119: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {56170#true} {56170#true} #78#return; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L272 TraceCheckUtils]: 121: Hoare triple {56170#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 122: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 123: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 124: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {56170#true} {56170#true} #80#return; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L272 TraceCheckUtils]: 126: Hoare triple {56170#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 127: Hoare triple {56170#true} ~cond := #in~cond; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 128: Hoare triple {56170#true} assume !(0 == ~cond); {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L290 TraceCheckUtils]: 129: Hoare triple {56170#true} assume true; {56170#true} is VALID [2022-04-28 13:35:56,591 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {56170#true} {56170#true} #82#return; {56170#true} is VALID [2022-04-28 13:35:56,592 INFO L290 TraceCheckUtils]: 131: Hoare triple {56170#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {56170#true} is VALID [2022-04-28 13:35:56,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {56170#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {56571#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-28 13:35:56,604 INFO L290 TraceCheckUtils]: 133: Hoare triple {56571#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {56575#(<= 51 ~counter~0)} is VALID [2022-04-28 13:35:56,604 INFO L290 TraceCheckUtils]: 134: Hoare triple {56575#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56579#(<= 51 |main_#t~post6|)} is VALID [2022-04-28 13:35:56,604 INFO L290 TraceCheckUtils]: 135: Hoare triple {56579#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,604 INFO L272 TraceCheckUtils]: 136: Hoare triple {56171#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,604 INFO L290 TraceCheckUtils]: 137: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 138: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 139: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {56171#false} {56171#false} #84#return; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L272 TraceCheckUtils]: 141: Hoare triple {56171#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 142: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 143: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 144: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {56171#false} {56171#false} #86#return; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 146: Hoare triple {56171#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 147: Hoare triple {56171#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 148: Hoare triple {56171#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 149: Hoare triple {56171#false} assume !!(#t~post6 < 50);havoc #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L272 TraceCheckUtils]: 150: Hoare triple {56171#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 151: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,605 INFO L290 TraceCheckUtils]: 152: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 153: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {56171#false} {56171#false} #84#return; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L272 TraceCheckUtils]: 155: Hoare triple {56171#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 156: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 157: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 158: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {56171#false} {56171#false} #86#return; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 160: Hoare triple {56171#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 161: Hoare triple {56171#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 162: Hoare triple {56171#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 163: Hoare triple {56171#false} assume !!(#t~post6 < 50);havoc #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L272 TraceCheckUtils]: 164: Hoare triple {56171#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 165: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 166: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,606 INFO L290 TraceCheckUtils]: 167: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {56171#false} {56171#false} #84#return; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L272 TraceCheckUtils]: 169: Hoare triple {56171#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 170: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 171: Hoare triple {56171#false} assume !(0 == ~cond); {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 172: Hoare triple {56171#false} assume true; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {56171#false} {56171#false} #86#return; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 174: Hoare triple {56171#false} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 175: Hoare triple {56171#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 176: Hoare triple {56171#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 177: Hoare triple {56171#false} assume !(#t~post6 < 50);havoc #t~post6; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L272 TraceCheckUtils]: 178: Hoare triple {56171#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 179: Hoare triple {56171#false} ~cond := #in~cond; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 180: Hoare triple {56171#false} assume 0 == ~cond; {56171#false} is VALID [2022-04-28 13:35:56,607 INFO L290 TraceCheckUtils]: 181: Hoare triple {56171#false} assume !false; {56171#false} is VALID [2022-04-28 13:35:56,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1622 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2022-04-28 13:35:56,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:35:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:35:56,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664438565] [2022-04-28 13:35:56,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:35:56,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943589362] [2022-04-28 13:35:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943589362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:35:56,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:35:56,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17561999] [2022-04-28 13:35:56,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17561999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:35:56,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:35:56,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:35:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121939513] [2022-04-28 13:35:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:35:56,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 182 [2022-04-28 13:35:56,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:35:56,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 13:35:56,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:35:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:35:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:35:56,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:35:56,642 INFO L87 Difference]: Start difference. First operand 547 states and 615 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 13:35:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:57,642 INFO L93 Difference]: Finished difference Result 622 states and 693 transitions. [2022-04-28 13:35:57,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:35:57,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 182 [2022-04-28 13:35:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:35:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 13:35:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 13:35:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 13:35:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 13:35:57,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 13:35:57,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:57,704 INFO L225 Difference]: With dead ends: 622 [2022-04-28 13:35:57,704 INFO L226 Difference]: Without dead ends: 509 [2022-04-28 13:35:57,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 13:35:57,705 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:35:57,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:35:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-04-28 13:35:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2022-04-28 13:35:58,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:35:58,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 509 states. Second operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-28 13:35:58,358 INFO L74 IsIncluded]: Start isIncluded. First operand 509 states. Second operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-28 13:35:58,358 INFO L87 Difference]: Start difference. First operand 509 states. Second operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-28 13:35:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:58,367 INFO L93 Difference]: Finished difference Result 509 states and 563 transitions. [2022-04-28 13:35:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 563 transitions. [2022-04-28 13:35:58,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:58,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:58,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 509 states. [2022-04-28 13:35:58,369 INFO L87 Difference]: Start difference. First operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) Second operand 509 states. [2022-04-28 13:35:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:35:58,377 INFO L93 Difference]: Finished difference Result 509 states and 563 transitions. [2022-04-28 13:35:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 563 transitions. [2022-04-28 13:35:58,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:35:58,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:35:58,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:35:58,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:35:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 346 states have (on average 1.0895953757225434) internal successors, (377), 352 states have internal predecessors, (377), 94 states have call successors, (94), 68 states have call predecessors, (94), 66 states have return successors, (91), 86 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-28 13:35:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 562 transitions. [2022-04-28 13:35:58,392 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 562 transitions. Word has length 182 [2022-04-28 13:35:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:35:58,392 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 562 transitions. [2022-04-28 13:35:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 13:35:58,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 507 states and 562 transitions. [2022-04-28 13:35:59,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:35:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 562 transitions. [2022-04-28 13:35:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 13:35:59,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:35:59,835 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:35:59,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 13:36:00,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:36:00,051 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:36:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:36:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 19 times [2022-04-28 13:36:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:36:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711107928] [2022-04-28 13:36:04,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:36:04,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:36:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -553486584, now seen corresponding path program 20 times [2022-04-28 13:36:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:36:04,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648594691] [2022-04-28 13:36:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:36:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:36:04,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:36:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565776171] [2022-04-28 13:36:04,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:36:04,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:36:04,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:36:04,155 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:36:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 13:36:04,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:36:04,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:36:04,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 13:36:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:36:04,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:36:05,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {59998#true} call ULTIMATE.init(); {59998#true} is VALID [2022-04-28 13:36:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {59998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60006#(<= ~counter~0 0)} is VALID [2022-04-28 13:36:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {60006#(<= ~counter~0 0)} assume true; {60006#(<= ~counter~0 0)} is VALID [2022-04-28 13:36:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60006#(<= ~counter~0 0)} {59998#true} #92#return; {60006#(<= ~counter~0 0)} is VALID [2022-04-28 13:36:05,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {60006#(<= ~counter~0 0)} call #t~ret7 := main(); {60006#(<= ~counter~0 0)} is VALID [2022-04-28 13:36:05,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {60006#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {60006#(<= ~counter~0 0)} is VALID [2022-04-28 13:36:05,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {60006#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {60022#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,194 INFO L272 TraceCheckUtils]: 8: Hoare triple {60022#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {60022#(<= ~counter~0 1)} ~cond := #in~cond; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {60022#(<= ~counter~0 1)} assume !(0 == ~cond); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {60022#(<= ~counter~0 1)} assume true; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,195 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60022#(<= ~counter~0 1)} {60022#(<= ~counter~0 1)} #78#return; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,195 INFO L272 TraceCheckUtils]: 13: Hoare triple {60022#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {60022#(<= ~counter~0 1)} ~cond := #in~cond; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {60022#(<= ~counter~0 1)} assume !(0 == ~cond); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {60022#(<= ~counter~0 1)} assume true; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,197 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {60022#(<= ~counter~0 1)} {60022#(<= ~counter~0 1)} #80#return; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,197 INFO L272 TraceCheckUtils]: 18: Hoare triple {60022#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {60022#(<= ~counter~0 1)} ~cond := #in~cond; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {60022#(<= ~counter~0 1)} assume !(0 == ~cond); {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {60022#(<= ~counter~0 1)} assume true; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,198 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {60022#(<= ~counter~0 1)} {60022#(<= ~counter~0 1)} #82#return; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {60022#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60022#(<= ~counter~0 1)} is VALID [2022-04-28 13:36:05,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {60022#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {60077#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,201 INFO L272 TraceCheckUtils]: 26: Hoare triple {60077#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {60077#(<= ~counter~0 2)} ~cond := #in~cond; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {60077#(<= ~counter~0 2)} assume !(0 == ~cond); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {60077#(<= ~counter~0 2)} assume true; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,202 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {60077#(<= ~counter~0 2)} {60077#(<= ~counter~0 2)} #78#return; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,202 INFO L272 TraceCheckUtils]: 31: Hoare triple {60077#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {60077#(<= ~counter~0 2)} ~cond := #in~cond; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {60077#(<= ~counter~0 2)} assume !(0 == ~cond); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {60077#(<= ~counter~0 2)} assume true; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,204 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {60077#(<= ~counter~0 2)} {60077#(<= ~counter~0 2)} #80#return; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,204 INFO L272 TraceCheckUtils]: 36: Hoare triple {60077#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {60077#(<= ~counter~0 2)} ~cond := #in~cond; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {60077#(<= ~counter~0 2)} assume !(0 == ~cond); {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {60077#(<= ~counter~0 2)} assume true; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,205 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {60077#(<= ~counter~0 2)} {60077#(<= ~counter~0 2)} #82#return; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {60077#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60077#(<= ~counter~0 2)} is VALID [2022-04-28 13:36:05,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {60077#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {60132#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,208 INFO L272 TraceCheckUtils]: 44: Hoare triple {60132#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {60132#(<= ~counter~0 3)} ~cond := #in~cond; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {60132#(<= ~counter~0 3)} assume !(0 == ~cond); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {60132#(<= ~counter~0 3)} assume true; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,209 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {60132#(<= ~counter~0 3)} {60132#(<= ~counter~0 3)} #78#return; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,209 INFO L272 TraceCheckUtils]: 49: Hoare triple {60132#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {60132#(<= ~counter~0 3)} ~cond := #in~cond; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {60132#(<= ~counter~0 3)} assume !(0 == ~cond); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {60132#(<= ~counter~0 3)} assume true; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,210 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {60132#(<= ~counter~0 3)} {60132#(<= ~counter~0 3)} #80#return; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,211 INFO L272 TraceCheckUtils]: 54: Hoare triple {60132#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {60132#(<= ~counter~0 3)} ~cond := #in~cond; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {60132#(<= ~counter~0 3)} assume !(0 == ~cond); {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {60132#(<= ~counter~0 3)} assume true; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,212 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {60132#(<= ~counter~0 3)} {60132#(<= ~counter~0 3)} #82#return; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {60132#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60132#(<= ~counter~0 3)} is VALID [2022-04-28 13:36:05,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {60132#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {60187#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,214 INFO L272 TraceCheckUtils]: 62: Hoare triple {60187#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {60187#(<= ~counter~0 4)} ~cond := #in~cond; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {60187#(<= ~counter~0 4)} assume !(0 == ~cond); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {60187#(<= ~counter~0 4)} assume true; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,215 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {60187#(<= ~counter~0 4)} {60187#(<= ~counter~0 4)} #78#return; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,216 INFO L272 TraceCheckUtils]: 67: Hoare triple {60187#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {60187#(<= ~counter~0 4)} ~cond := #in~cond; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {60187#(<= ~counter~0 4)} assume !(0 == ~cond); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {60187#(<= ~counter~0 4)} assume true; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,217 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60187#(<= ~counter~0 4)} {60187#(<= ~counter~0 4)} #80#return; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,217 INFO L272 TraceCheckUtils]: 72: Hoare triple {60187#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {60187#(<= ~counter~0 4)} ~cond := #in~cond; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,218 INFO L290 TraceCheckUtils]: 74: Hoare triple {60187#(<= ~counter~0 4)} assume !(0 == ~cond); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {60187#(<= ~counter~0 4)} assume true; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,219 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {60187#(<= ~counter~0 4)} {60187#(<= ~counter~0 4)} #82#return; {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,219 INFO L290 TraceCheckUtils]: 77: Hoare triple {60187#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {60187#(<= ~counter~0 4)} is VALID [2022-04-28 13:36:05,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {60187#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {60242#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,221 INFO L272 TraceCheckUtils]: 80: Hoare triple {60242#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {60242#(<= ~counter~0 5)} ~cond := #in~cond; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,221 INFO L290 TraceCheckUtils]: 82: Hoare triple {60242#(<= ~counter~0 5)} assume !(0 == ~cond); {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,221 INFO L290 TraceCheckUtils]: 83: Hoare triple {60242#(<= ~counter~0 5)} assume true; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,222 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {60242#(<= ~counter~0 5)} {60242#(<= ~counter~0 5)} #84#return; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,222 INFO L272 TraceCheckUtils]: 85: Hoare triple {60242#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,223 INFO L290 TraceCheckUtils]: 86: Hoare triple {60242#(<= ~counter~0 5)} ~cond := #in~cond; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,223 INFO L290 TraceCheckUtils]: 87: Hoare triple {60242#(<= ~counter~0 5)} assume !(0 == ~cond); {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,223 INFO L290 TraceCheckUtils]: 88: Hoare triple {60242#(<= ~counter~0 5)} assume true; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,224 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {60242#(<= ~counter~0 5)} {60242#(<= ~counter~0 5)} #86#return; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,224 INFO L290 TraceCheckUtils]: 90: Hoare triple {60242#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,224 INFO L290 TraceCheckUtils]: 91: Hoare triple {60242#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60242#(<= ~counter~0 5)} is VALID [2022-04-28 13:36:05,225 INFO L290 TraceCheckUtils]: 92: Hoare triple {60242#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,225 INFO L290 TraceCheckUtils]: 93: Hoare triple {60285#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,226 INFO L272 TraceCheckUtils]: 94: Hoare triple {60285#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,226 INFO L290 TraceCheckUtils]: 95: Hoare triple {60285#(<= ~counter~0 6)} ~cond := #in~cond; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,226 INFO L290 TraceCheckUtils]: 96: Hoare triple {60285#(<= ~counter~0 6)} assume !(0 == ~cond); {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,227 INFO L290 TraceCheckUtils]: 97: Hoare triple {60285#(<= ~counter~0 6)} assume true; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,227 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {60285#(<= ~counter~0 6)} {60285#(<= ~counter~0 6)} #84#return; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,228 INFO L272 TraceCheckUtils]: 99: Hoare triple {60285#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,228 INFO L290 TraceCheckUtils]: 100: Hoare triple {60285#(<= ~counter~0 6)} ~cond := #in~cond; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,228 INFO L290 TraceCheckUtils]: 101: Hoare triple {60285#(<= ~counter~0 6)} assume !(0 == ~cond); {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {60285#(<= ~counter~0 6)} assume true; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,229 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60285#(<= ~counter~0 6)} {60285#(<= ~counter~0 6)} #86#return; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,229 INFO L290 TraceCheckUtils]: 104: Hoare triple {60285#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {60285#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60285#(<= ~counter~0 6)} is VALID [2022-04-28 13:36:05,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {60285#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,231 INFO L290 TraceCheckUtils]: 107: Hoare triple {60328#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,231 INFO L272 TraceCheckUtils]: 108: Hoare triple {60328#(<= ~counter~0 7)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {60328#(<= ~counter~0 7)} ~cond := #in~cond; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {60328#(<= ~counter~0 7)} assume !(0 == ~cond); {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,232 INFO L290 TraceCheckUtils]: 111: Hoare triple {60328#(<= ~counter~0 7)} assume true; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,233 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {60328#(<= ~counter~0 7)} {60328#(<= ~counter~0 7)} #84#return; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,233 INFO L272 TraceCheckUtils]: 113: Hoare triple {60328#(<= ~counter~0 7)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,233 INFO L290 TraceCheckUtils]: 114: Hoare triple {60328#(<= ~counter~0 7)} ~cond := #in~cond; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {60328#(<= ~counter~0 7)} assume !(0 == ~cond); {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,234 INFO L290 TraceCheckUtils]: 116: Hoare triple {60328#(<= ~counter~0 7)} assume true; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,234 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {60328#(<= ~counter~0 7)} {60328#(<= ~counter~0 7)} #86#return; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,235 INFO L290 TraceCheckUtils]: 118: Hoare triple {60328#(<= ~counter~0 7)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {60328#(<= ~counter~0 7)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60328#(<= ~counter~0 7)} is VALID [2022-04-28 13:36:05,236 INFO L290 TraceCheckUtils]: 120: Hoare triple {60328#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,236 INFO L290 TraceCheckUtils]: 121: Hoare triple {60371#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,237 INFO L272 TraceCheckUtils]: 122: Hoare triple {60371#(<= ~counter~0 8)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,237 INFO L290 TraceCheckUtils]: 123: Hoare triple {60371#(<= ~counter~0 8)} ~cond := #in~cond; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,237 INFO L290 TraceCheckUtils]: 124: Hoare triple {60371#(<= ~counter~0 8)} assume !(0 == ~cond); {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {60371#(<= ~counter~0 8)} assume true; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,238 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {60371#(<= ~counter~0 8)} {60371#(<= ~counter~0 8)} #84#return; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,238 INFO L272 TraceCheckUtils]: 127: Hoare triple {60371#(<= ~counter~0 8)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,239 INFO L290 TraceCheckUtils]: 128: Hoare triple {60371#(<= ~counter~0 8)} ~cond := #in~cond; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,239 INFO L290 TraceCheckUtils]: 129: Hoare triple {60371#(<= ~counter~0 8)} assume !(0 == ~cond); {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,239 INFO L290 TraceCheckUtils]: 130: Hoare triple {60371#(<= ~counter~0 8)} assume true; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,240 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {60371#(<= ~counter~0 8)} {60371#(<= ~counter~0 8)} #86#return; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,240 INFO L290 TraceCheckUtils]: 132: Hoare triple {60371#(<= ~counter~0 8)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,240 INFO L290 TraceCheckUtils]: 133: Hoare triple {60371#(<= ~counter~0 8)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60371#(<= ~counter~0 8)} is VALID [2022-04-28 13:36:05,241 INFO L290 TraceCheckUtils]: 134: Hoare triple {60371#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,242 INFO L290 TraceCheckUtils]: 135: Hoare triple {60414#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,242 INFO L272 TraceCheckUtils]: 136: Hoare triple {60414#(<= ~counter~0 9)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,242 INFO L290 TraceCheckUtils]: 137: Hoare triple {60414#(<= ~counter~0 9)} ~cond := #in~cond; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,243 INFO L290 TraceCheckUtils]: 138: Hoare triple {60414#(<= ~counter~0 9)} assume !(0 == ~cond); {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,243 INFO L290 TraceCheckUtils]: 139: Hoare triple {60414#(<= ~counter~0 9)} assume true; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,243 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {60414#(<= ~counter~0 9)} {60414#(<= ~counter~0 9)} #84#return; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,244 INFO L272 TraceCheckUtils]: 141: Hoare triple {60414#(<= ~counter~0 9)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,244 INFO L290 TraceCheckUtils]: 142: Hoare triple {60414#(<= ~counter~0 9)} ~cond := #in~cond; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,245 INFO L290 TraceCheckUtils]: 143: Hoare triple {60414#(<= ~counter~0 9)} assume !(0 == ~cond); {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,245 INFO L290 TraceCheckUtils]: 144: Hoare triple {60414#(<= ~counter~0 9)} assume true; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,245 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {60414#(<= ~counter~0 9)} {60414#(<= ~counter~0 9)} #86#return; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,246 INFO L290 TraceCheckUtils]: 146: Hoare triple {60414#(<= ~counter~0 9)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,246 INFO L290 TraceCheckUtils]: 147: Hoare triple {60414#(<= ~counter~0 9)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60414#(<= ~counter~0 9)} is VALID [2022-04-28 13:36:05,247 INFO L290 TraceCheckUtils]: 148: Hoare triple {60414#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,247 INFO L290 TraceCheckUtils]: 149: Hoare triple {60457#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,248 INFO L272 TraceCheckUtils]: 150: Hoare triple {60457#(<= ~counter~0 10)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,248 INFO L290 TraceCheckUtils]: 151: Hoare triple {60457#(<= ~counter~0 10)} ~cond := #in~cond; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,248 INFO L290 TraceCheckUtils]: 152: Hoare triple {60457#(<= ~counter~0 10)} assume !(0 == ~cond); {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,248 INFO L290 TraceCheckUtils]: 153: Hoare triple {60457#(<= ~counter~0 10)} assume true; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,249 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {60457#(<= ~counter~0 10)} {60457#(<= ~counter~0 10)} #84#return; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,249 INFO L272 TraceCheckUtils]: 155: Hoare triple {60457#(<= ~counter~0 10)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,250 INFO L290 TraceCheckUtils]: 156: Hoare triple {60457#(<= ~counter~0 10)} ~cond := #in~cond; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,250 INFO L290 TraceCheckUtils]: 157: Hoare triple {60457#(<= ~counter~0 10)} assume !(0 == ~cond); {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,250 INFO L290 TraceCheckUtils]: 158: Hoare triple {60457#(<= ~counter~0 10)} assume true; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,251 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {60457#(<= ~counter~0 10)} {60457#(<= ~counter~0 10)} #86#return; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,251 INFO L290 TraceCheckUtils]: 160: Hoare triple {60457#(<= ~counter~0 10)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,251 INFO L290 TraceCheckUtils]: 161: Hoare triple {60457#(<= ~counter~0 10)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60457#(<= ~counter~0 10)} is VALID [2022-04-28 13:36:05,252 INFO L290 TraceCheckUtils]: 162: Hoare triple {60457#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,252 INFO L290 TraceCheckUtils]: 163: Hoare triple {60500#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,253 INFO L272 TraceCheckUtils]: 164: Hoare triple {60500#(<= ~counter~0 11)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,253 INFO L290 TraceCheckUtils]: 165: Hoare triple {60500#(<= ~counter~0 11)} ~cond := #in~cond; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,261 INFO L290 TraceCheckUtils]: 166: Hoare triple {60500#(<= ~counter~0 11)} assume !(0 == ~cond); {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,262 INFO L290 TraceCheckUtils]: 167: Hoare triple {60500#(<= ~counter~0 11)} assume true; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,262 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {60500#(<= ~counter~0 11)} {60500#(<= ~counter~0 11)} #84#return; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,263 INFO L272 TraceCheckUtils]: 169: Hoare triple {60500#(<= ~counter~0 11)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,263 INFO L290 TraceCheckUtils]: 170: Hoare triple {60500#(<= ~counter~0 11)} ~cond := #in~cond; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,263 INFO L290 TraceCheckUtils]: 171: Hoare triple {60500#(<= ~counter~0 11)} assume !(0 == ~cond); {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,263 INFO L290 TraceCheckUtils]: 172: Hoare triple {60500#(<= ~counter~0 11)} assume true; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,264 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {60500#(<= ~counter~0 11)} {60500#(<= ~counter~0 11)} #86#return; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,264 INFO L290 TraceCheckUtils]: 174: Hoare triple {60500#(<= ~counter~0 11)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,264 INFO L290 TraceCheckUtils]: 175: Hoare triple {60500#(<= ~counter~0 11)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60500#(<= ~counter~0 11)} is VALID [2022-04-28 13:36:05,265 INFO L290 TraceCheckUtils]: 176: Hoare triple {60500#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60543#(<= |main_#t~post6| 11)} is VALID [2022-04-28 13:36:05,265 INFO L290 TraceCheckUtils]: 177: Hoare triple {60543#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {59999#false} is VALID [2022-04-28 13:36:05,265 INFO L272 TraceCheckUtils]: 178: Hoare triple {59999#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {59999#false} is VALID [2022-04-28 13:36:05,265 INFO L290 TraceCheckUtils]: 179: Hoare triple {59999#false} ~cond := #in~cond; {59999#false} is VALID [2022-04-28 13:36:05,265 INFO L290 TraceCheckUtils]: 180: Hoare triple {59999#false} assume 0 == ~cond; {59999#false} is VALID [2022-04-28 13:36:05,266 INFO L290 TraceCheckUtils]: 181: Hoare triple {59999#false} assume !false; {59999#false} is VALID [2022-04-28 13:36:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 52 proven. 1400 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-04-28 13:36:05,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:36:06,277 INFO L290 TraceCheckUtils]: 181: Hoare triple {59999#false} assume !false; {59999#false} is VALID [2022-04-28 13:36:06,277 INFO L290 TraceCheckUtils]: 180: Hoare triple {59999#false} assume 0 == ~cond; {59999#false} is VALID [2022-04-28 13:36:06,277 INFO L290 TraceCheckUtils]: 179: Hoare triple {59999#false} ~cond := #in~cond; {59999#false} is VALID [2022-04-28 13:36:06,277 INFO L272 TraceCheckUtils]: 178: Hoare triple {59999#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {59999#false} is VALID [2022-04-28 13:36:06,278 INFO L290 TraceCheckUtils]: 177: Hoare triple {60571#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {59999#false} is VALID [2022-04-28 13:36:06,278 INFO L290 TraceCheckUtils]: 176: Hoare triple {60575#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60571#(< |main_#t~post6| 50)} is VALID [2022-04-28 13:36:06,278 INFO L290 TraceCheckUtils]: 175: Hoare triple {60575#(< ~counter~0 50)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,279 INFO L290 TraceCheckUtils]: 174: Hoare triple {60575#(< ~counter~0 50)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,279 INFO L284 TraceCheckUtils]: 173: Hoare quadruple {59998#true} {60575#(< ~counter~0 50)} #86#return; {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,279 INFO L290 TraceCheckUtils]: 172: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,279 INFO L290 TraceCheckUtils]: 171: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,279 INFO L290 TraceCheckUtils]: 170: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,279 INFO L272 TraceCheckUtils]: 169: Hoare triple {60575#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,280 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {59998#true} {60575#(< ~counter~0 50)} #84#return; {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,280 INFO L290 TraceCheckUtils]: 167: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,280 INFO L290 TraceCheckUtils]: 166: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,280 INFO L290 TraceCheckUtils]: 165: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,280 INFO L272 TraceCheckUtils]: 164: Hoare triple {60575#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,280 INFO L290 TraceCheckUtils]: 163: Hoare triple {60575#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,282 INFO L290 TraceCheckUtils]: 162: Hoare triple {60618#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60575#(< ~counter~0 50)} is VALID [2022-04-28 13:36:06,282 INFO L290 TraceCheckUtils]: 161: Hoare triple {60618#(< ~counter~0 49)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,282 INFO L290 TraceCheckUtils]: 160: Hoare triple {60618#(< ~counter~0 49)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,283 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {59998#true} {60618#(< ~counter~0 49)} #86#return; {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,283 INFO L290 TraceCheckUtils]: 158: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,283 INFO L290 TraceCheckUtils]: 157: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,283 INFO L290 TraceCheckUtils]: 156: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,283 INFO L272 TraceCheckUtils]: 155: Hoare triple {60618#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,283 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {59998#true} {60618#(< ~counter~0 49)} #84#return; {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,284 INFO L290 TraceCheckUtils]: 153: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,284 INFO L290 TraceCheckUtils]: 152: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,284 INFO L290 TraceCheckUtils]: 151: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,284 INFO L272 TraceCheckUtils]: 150: Hoare triple {60618#(< ~counter~0 49)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,284 INFO L290 TraceCheckUtils]: 149: Hoare triple {60618#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,285 INFO L290 TraceCheckUtils]: 148: Hoare triple {60661#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60618#(< ~counter~0 49)} is VALID [2022-04-28 13:36:06,285 INFO L290 TraceCheckUtils]: 147: Hoare triple {60661#(< ~counter~0 48)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,285 INFO L290 TraceCheckUtils]: 146: Hoare triple {60661#(< ~counter~0 48)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,286 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {59998#true} {60661#(< ~counter~0 48)} #86#return; {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,286 INFO L290 TraceCheckUtils]: 144: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,286 INFO L290 TraceCheckUtils]: 143: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,286 INFO L290 TraceCheckUtils]: 142: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,286 INFO L272 TraceCheckUtils]: 141: Hoare triple {60661#(< ~counter~0 48)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,286 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {59998#true} {60661#(< ~counter~0 48)} #84#return; {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,287 INFO L290 TraceCheckUtils]: 139: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,287 INFO L290 TraceCheckUtils]: 138: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,287 INFO L290 TraceCheckUtils]: 137: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,287 INFO L272 TraceCheckUtils]: 136: Hoare triple {60661#(< ~counter~0 48)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,287 INFO L290 TraceCheckUtils]: 135: Hoare triple {60661#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,288 INFO L290 TraceCheckUtils]: 134: Hoare triple {60704#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60661#(< ~counter~0 48)} is VALID [2022-04-28 13:36:06,288 INFO L290 TraceCheckUtils]: 133: Hoare triple {60704#(< ~counter~0 47)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,288 INFO L290 TraceCheckUtils]: 132: Hoare triple {60704#(< ~counter~0 47)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,289 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {59998#true} {60704#(< ~counter~0 47)} #86#return; {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,289 INFO L290 TraceCheckUtils]: 130: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,289 INFO L290 TraceCheckUtils]: 129: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,289 INFO L290 TraceCheckUtils]: 128: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,289 INFO L272 TraceCheckUtils]: 127: Hoare triple {60704#(< ~counter~0 47)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,290 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {59998#true} {60704#(< ~counter~0 47)} #84#return; {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,290 INFO L290 TraceCheckUtils]: 125: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,290 INFO L290 TraceCheckUtils]: 124: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,290 INFO L290 TraceCheckUtils]: 123: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,290 INFO L272 TraceCheckUtils]: 122: Hoare triple {60704#(< ~counter~0 47)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,290 INFO L290 TraceCheckUtils]: 121: Hoare triple {60704#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,291 INFO L290 TraceCheckUtils]: 120: Hoare triple {60747#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60704#(< ~counter~0 47)} is VALID [2022-04-28 13:36:06,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {60747#(< ~counter~0 46)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,291 INFO L290 TraceCheckUtils]: 118: Hoare triple {60747#(< ~counter~0 46)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,292 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {59998#true} {60747#(< ~counter~0 46)} #86#return; {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,292 INFO L290 TraceCheckUtils]: 116: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,292 INFO L290 TraceCheckUtils]: 115: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,292 INFO L290 TraceCheckUtils]: 114: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,292 INFO L272 TraceCheckUtils]: 113: Hoare triple {60747#(< ~counter~0 46)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,292 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {59998#true} {60747#(< ~counter~0 46)} #84#return; {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,293 INFO L290 TraceCheckUtils]: 111: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,293 INFO L290 TraceCheckUtils]: 110: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,293 INFO L290 TraceCheckUtils]: 109: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,293 INFO L272 TraceCheckUtils]: 108: Hoare triple {60747#(< ~counter~0 46)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,293 INFO L290 TraceCheckUtils]: 107: Hoare triple {60747#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,294 INFO L290 TraceCheckUtils]: 106: Hoare triple {60790#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60747#(< ~counter~0 46)} is VALID [2022-04-28 13:36:06,294 INFO L290 TraceCheckUtils]: 105: Hoare triple {60790#(< ~counter~0 45)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,294 INFO L290 TraceCheckUtils]: 104: Hoare triple {60790#(< ~counter~0 45)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,295 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {59998#true} {60790#(< ~counter~0 45)} #86#return; {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,295 INFO L290 TraceCheckUtils]: 102: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,295 INFO L290 TraceCheckUtils]: 101: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,295 INFO L290 TraceCheckUtils]: 100: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,295 INFO L272 TraceCheckUtils]: 99: Hoare triple {60790#(< ~counter~0 45)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,296 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {59998#true} {60790#(< ~counter~0 45)} #84#return; {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,296 INFO L290 TraceCheckUtils]: 97: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,296 INFO L290 TraceCheckUtils]: 96: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,296 INFO L290 TraceCheckUtils]: 95: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,296 INFO L272 TraceCheckUtils]: 94: Hoare triple {60790#(< ~counter~0 45)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,296 INFO L290 TraceCheckUtils]: 93: Hoare triple {60790#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,297 INFO L290 TraceCheckUtils]: 92: Hoare triple {60833#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60790#(< ~counter~0 45)} is VALID [2022-04-28 13:36:06,297 INFO L290 TraceCheckUtils]: 91: Hoare triple {60833#(< ~counter~0 44)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,297 INFO L290 TraceCheckUtils]: 90: Hoare triple {60833#(< ~counter~0 44)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,298 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {59998#true} {60833#(< ~counter~0 44)} #86#return; {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,298 INFO L290 TraceCheckUtils]: 86: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,298 INFO L272 TraceCheckUtils]: 85: Hoare triple {60833#(< ~counter~0 44)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,298 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {59998#true} {60833#(< ~counter~0 44)} #84#return; {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,299 INFO L290 TraceCheckUtils]: 83: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,299 INFO L290 TraceCheckUtils]: 82: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,299 INFO L272 TraceCheckUtils]: 80: Hoare triple {60833#(< ~counter~0 44)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,299 INFO L290 TraceCheckUtils]: 79: Hoare triple {60833#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {60876#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60833#(< ~counter~0 44)} is VALID [2022-04-28 13:36:06,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {60876#(< ~counter~0 43)} assume !(~r~0 >= ~d~0); {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,300 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {59998#true} {60876#(< ~counter~0 43)} #82#return; {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L272 TraceCheckUtils]: 72: Hoare triple {60876#(< ~counter~0 43)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {59998#true} {60876#(< ~counter~0 43)} #80#return; {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 70: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 69: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,301 INFO L272 TraceCheckUtils]: 67: Hoare triple {60876#(< ~counter~0 43)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,302 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {59998#true} {60876#(< ~counter~0 43)} #78#return; {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,302 INFO L272 TraceCheckUtils]: 62: Hoare triple {60876#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {60876#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {60931#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60876#(< ~counter~0 43)} is VALID [2022-04-28 13:36:06,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {60931#(< ~counter~0 42)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,304 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {59998#true} {60931#(< ~counter~0 42)} #82#return; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,304 INFO L272 TraceCheckUtils]: 54: Hoare triple {60931#(< ~counter~0 42)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {59998#true} {60931#(< ~counter~0 42)} #80#return; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L272 TraceCheckUtils]: 49: Hoare triple {60931#(< ~counter~0 42)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {59998#true} {60931#(< ~counter~0 42)} #78#return; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,305 INFO L272 TraceCheckUtils]: 44: Hoare triple {60931#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {60931#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {60986#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60931#(< ~counter~0 42)} is VALID [2022-04-28 13:36:06,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {60986#(< ~counter~0 41)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,307 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {59998#true} {60986#(< ~counter~0 41)} #82#return; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,307 INFO L272 TraceCheckUtils]: 36: Hoare triple {60986#(< ~counter~0 41)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,308 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {59998#true} {60986#(< ~counter~0 41)} #80#return; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,308 INFO L272 TraceCheckUtils]: 31: Hoare triple {60986#(< ~counter~0 41)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,308 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {59998#true} {60986#(< ~counter~0 41)} #78#return; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,309 INFO L272 TraceCheckUtils]: 26: Hoare triple {60986#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {60986#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {61041#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {60986#(< ~counter~0 41)} is VALID [2022-04-28 13:36:06,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {61041#(< ~counter~0 40)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,311 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {59998#true} {61041#(< ~counter~0 40)} #82#return; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {61041#(< ~counter~0 40)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,311 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {59998#true} {61041#(< ~counter~0 40)} #80#return; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L272 TraceCheckUtils]: 13: Hoare triple {61041#(< ~counter~0 40)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {59998#true} {61041#(< ~counter~0 40)} #78#return; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {59998#true} assume true; {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {59998#true} assume !(0 == ~cond); {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {59998#true} ~cond := #in~cond; {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L272 TraceCheckUtils]: 8: Hoare triple {61041#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {59998#true} is VALID [2022-04-28 13:36:06,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {61041#(< ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {61096#(< ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {61041#(< ~counter~0 40)} is VALID [2022-04-28 13:36:06,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {61096#(< ~counter~0 39)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {61096#(< ~counter~0 39)} is VALID [2022-04-28 13:36:06,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {61096#(< ~counter~0 39)} call #t~ret7 := main(); {61096#(< ~counter~0 39)} is VALID [2022-04-28 13:36:06,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61096#(< ~counter~0 39)} {59998#true} #92#return; {61096#(< ~counter~0 39)} is VALID [2022-04-28 13:36:06,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {61096#(< ~counter~0 39)} assume true; {61096#(< ~counter~0 39)} is VALID [2022-04-28 13:36:06,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {59998#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {61096#(< ~counter~0 39)} is VALID [2022-04-28 13:36:06,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {59998#true} call ULTIMATE.init(); {59998#true} is VALID [2022-04-28 13:36:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 52 proven. 176 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2022-04-28 13:36:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:36:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648594691] [2022-04-28 13:36:06,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:36:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565776171] [2022-04-28 13:36:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565776171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:36:06,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:36:06,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-28 13:36:06,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:36:06,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711107928] [2022-04-28 13:36:06,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711107928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:36:06,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:36:06,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 13:36:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936288235] [2022-04-28 13:36:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:36:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 182 [2022-04-28 13:36:06,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:36:06,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-28 13:36:06,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:36:06,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 13:36:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:36:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 13:36:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-28 13:36:06,445 INFO L87 Difference]: Start difference. First operand 507 states and 562 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-28 13:36:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:36:08,568 INFO L93 Difference]: Finished difference Result 597 states and 667 transitions. [2022-04-28 13:36:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 13:36:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) Word has length 182 [2022-04-28 13:36:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:36:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-28 13:36:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-28 13:36:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-28 13:36:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 250 transitions. [2022-04-28 13:36:08,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 250 transitions. [2022-04-28 13:36:08,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:36:08,778 INFO L225 Difference]: With dead ends: 597 [2022-04-28 13:36:08,778 INFO L226 Difference]: Without dead ends: 574 [2022-04-28 13:36:08,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=491, Invalid=699, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 13:36:08,779 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 13:36:08,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 323 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 13:36:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-28 13:36:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2022-04-28 13:36:09,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:36:09,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-28 13:36:09,700 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-28 13:36:09,701 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-28 13:36:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:36:09,712 INFO L93 Difference]: Finished difference Result 574 states and 638 transitions. [2022-04-28 13:36:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 638 transitions. [2022-04-28 13:36:09,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:36:09,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:36:09,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 574 states. [2022-04-28 13:36:09,714 INFO L87 Difference]: Start difference. First operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 574 states. [2022-04-28 13:36:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:36:09,725 INFO L93 Difference]: Finished difference Result 574 states and 638 transitions. [2022-04-28 13:36:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 638 transitions. [2022-04-28 13:36:09,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:36:09,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:36:09,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:36:09,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:36:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 391 states have (on average 1.0895140664961638) internal successors, (426), 398 states have internal predecessors, (426), 107 states have call successors, (107), 76 states have call predecessors, (107), 74 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-28 13:36:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 637 transitions. [2022-04-28 13:36:09,744 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 637 transitions. Word has length 182 [2022-04-28 13:36:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:36:09,744 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 637 transitions. [2022-04-28 13:36:09,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 14 states have call successors, (29), 14 states have call predecessors, (29), 12 states have return successors, (27), 12 states have call predecessors, (27), 12 states have call successors, (27) [2022-04-28 13:36:09,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 573 states and 637 transitions. [2022-04-28 13:36:11,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:36:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 637 transitions. [2022-04-28 13:36:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-28 13:36:11,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:36:11,340 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:36:11,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 13:36:11,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 13:36:11,555 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:36:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:36:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 21 times [2022-04-28 13:36:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:36:11,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711274943] [2022-04-28 13:36:15,367 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 13:36:15,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 13:36:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1093935796, now seen corresponding path program 22 times [2022-04-28 13:36:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:36:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004275737] [2022-04-28 13:36:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:36:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:36:15,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:36:15,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025486655] [2022-04-28 13:36:15,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:36:15,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:36:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:36:15,394 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:36:15,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process